About the Execution of GreatSPN+red for CANConstruction-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12092.663 | 3600000.00 | 4852501.00 | 7025.70 | ????????F?T?F??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503600025.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600025
=====================================================================
--------------------
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-CTLCardinality-2024-00
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-01
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-02
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-03
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-04
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-05
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-06
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-07
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-08
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-09
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-10
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2024-11
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-12
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-13
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-14
FORMULA_NAME CANConstruction-PT-030-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716362516165
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
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:21:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:21:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:21:57] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-22 07:21:57] [INFO ] Transformed 2162 places.
[2024-05-22 07:21:57] [INFO ] Transformed 3840 transitions.
[2024-05-22 07:21:57] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 124 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 786 places :
Symmetric choice reduction at 0 with 786 rule applications. Total rules 786 place count 1376 transition count 2268
Iterating global reduction 0 with 786 rules applied. Total rules applied 1572 place count 1376 transition count 2268
Applied a total of 1572 rules in 332 ms. Remains 1376 /2162 variables (removed 786) and now considering 2268/3840 (removed 1572) transitions.
// Phase 1: matrix 2268 rows 1376 cols
[2024-05-22 07:21:58] [INFO ] Computed 61 invariants in 47 ms
[2024-05-22 07:21:59] [INFO ] Implicit Places using invariants in 1008 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1044 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1348/2162 places, 2268/3840 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1326 transition count 2246
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1326 transition count 2246
Applied a total of 44 rules in 462 ms. Remains 1326 /1348 variables (removed 22) and now considering 2246/2268 (removed 22) transitions.
// Phase 1: matrix 2246 rows 1326 cols
[2024-05-22 07:21:59] [INFO ] Computed 33 invariants in 22 ms
[2024-05-22 07:22:00] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-22 07:22:00] [INFO ] Invariant cache hit.
[2024-05-22 07:22:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 07:22:08] [INFO ] Implicit Places using invariants and state equation in 7852 ms returned []
Implicit Place search using SMT with State Equation took 8535 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1326/2162 places, 2246/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10391 ms. Remains : 1326/2162 places, 2246/3840 transitions.
Support contains 124 out of 1326 places after structural reductions.
[2024-05-22 07:22:08] [INFO ] Flatten gal took : 153 ms
[2024-05-22 07:22:08] [INFO ] Flatten gal took : 115 ms
[2024-05-22 07:22:08] [INFO ] Input system was already deterministic with 2246 transitions.
RANDOM walk for 40000 steps (72 resets) in 2383 ms. (16 steps per ms) remains 19/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
[2024-05-22 07:22:09] [INFO ] Invariant cache hit.
[2024-05-22 07:22:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 1283/1313 variables, 20/20 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1313 variables, 1/21 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1313 variables, 0/21 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 11/1324 variables, 11/32 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 0/32 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/1325 variables, 1/33 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1325 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2246/3571 variables, 1325/1358 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3571 variables, 1770/3128 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3571 variables, 0/3128 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/3572 variables, 1/3129 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3572 variables, 0/3129 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/3572 variables, 0/3129 constraints. Problems are: Problem set: 13 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3572/3572 variables, and 3129 constraints, problems are : Problem set: 13 solved, 6 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1326/1326 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1291/1308 variables, 15/15 constraints. Problems are: Problem set: 13 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1308 variables, 1/16 constraints. Problems are: Problem set: 13 solved, 6 unsolved
[2024-05-22 07:22:13] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 61 ms to minimize.
[2024-05-22 07:22:14] [INFO ] Deduced a trap composed of 5 places in 589 ms of which 11 ms to minimize.
[2024-05-22 07:22:14] [INFO ] Deduced a trap composed of 5 places in 554 ms of which 8 ms to minimize.
[2024-05-22 07:22:15] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 6 ms to minimize.
[2024-05-22 07:22:15] [INFO ] Deduced a trap composed of 5 places in 550 ms of which 8 ms to minimize.
[2024-05-22 07:22:16] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 7 ms to minimize.
[2024-05-22 07:22:16] [INFO ] Deduced a trap composed of 5 places in 579 ms of which 8 ms to minimize.
[2024-05-22 07:22:17] [INFO ] Deduced a trap composed of 5 places in 525 ms of which 8 ms to minimize.
[2024-05-22 07:22:18] [INFO ] Deduced a trap composed of 5 places in 521 ms of which 7 ms to minimize.
SMT process timed out in 8266ms, After SMT, problems are : Problem set: 13 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1326 transition count 2058
Reduce places removed 188 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 190 rules applied. Total rules applied 378 place count 1138 transition count 2056
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 380 place count 1136 transition count 2056
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 380 place count 1136 transition count 2027
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 438 place count 1107 transition count 2027
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 487 place count 1058 transition count 1929
Iterating global reduction 3 with 49 rules applied. Total rules applied 536 place count 1058 transition count 1929
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 23 rules applied. Total rules applied 559 place count 1058 transition count 1906
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 582 place count 1035 transition count 1906
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 638 place count 1007 transition count 1878
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 641 place count 1007 transition count 1875
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 644 place count 1004 transition count 1875
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 646 place count 1004 transition count 1875
Applied a total of 646 rules in 712 ms. Remains 1004 /1326 variables (removed 322) and now considering 1875/2246 (removed 371) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 1004/1326 places, 1875/2246 transitions.
RANDOM walk for 40000 steps (190 resets) in 613 ms. (65 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
// Phase 1: matrix 1875 rows 1004 cols
[2024-05-22 07:22:19] [INFO ] Computed 33 invariants in 12 ms
[2024-05-22 07:22:19] [INFO ] State equation strengthened by 1772 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 970/982 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/982 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 20/1002 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/1003 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1875/2878 variables, 1003/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2878 variables, 1772/2808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2878 variables, 0/2808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/2879 variables, 1/2809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2879 variables, 0/2809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2879 variables, 0/2809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 2809 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1004/1004 constraints, ReadFeed: 1772/1772 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 970/982 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/982 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:22:21] [INFO ] Deduced a trap composed of 2 places in 338 ms of which 5 ms to minimize.
[2024-05-22 07:22:21] [INFO ] Deduced a trap composed of 2 places in 338 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/1002 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:22:22] [INFO ] Deduced a trap composed of 33 places in 550 ms of which 7 ms to minimize.
[2024-05-22 07:22:22] [INFO ] Deduced a trap composed of 34 places in 558 ms of which 7 ms to minimize.
[2024-05-22 07:22:23] [INFO ] Deduced a trap composed of 34 places in 545 ms of which 6 ms to minimize.
[2024-05-22 07:22:23] [INFO ] Deduced a trap composed of 33 places in 530 ms of which 7 ms to minimize.
[2024-05-22 07:22:24] [INFO ] Deduced a trap composed of 33 places in 502 ms of which 6 ms to minimize.
[2024-05-22 07:22:24] [INFO ] Deduced a trap composed of 33 places in 491 ms of which 6 ms to minimize.
[2024-05-22 07:22:25] [INFO ] Deduced a trap composed of 36 places in 533 ms of which 7 ms to minimize.
[2024-05-22 07:22:25] [INFO ] Deduced a trap composed of 33 places in 515 ms of which 7 ms to minimize.
[2024-05-22 07:22:26] [INFO ] Deduced a trap composed of 33 places in 511 ms of which 7 ms to minimize.
[2024-05-22 07:22:27] [INFO ] Deduced a trap composed of 35 places in 520 ms of which 6 ms to minimize.
[2024-05-22 07:22:27] [INFO ] Deduced a trap composed of 34 places in 557 ms of which 7 ms to minimize.
[2024-05-22 07:22:28] [INFO ] Deduced a trap composed of 34 places in 530 ms of which 7 ms to minimize.
[2024-05-22 07:22:28] [INFO ] Deduced a trap composed of 33 places in 533 ms of which 7 ms to minimize.
[2024-05-22 07:22:29] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 7 ms to minimize.
[2024-05-22 07:22:29] [INFO ] Deduced a trap composed of 35 places in 519 ms of which 6 ms to minimize.
[2024-05-22 07:22:30] [INFO ] Deduced a trap composed of 35 places in 516 ms of which 6 ms to minimize.
[2024-05-22 07:22:30] [INFO ] Deduced a trap composed of 34 places in 546 ms of which 6 ms to minimize.
[2024-05-22 07:22:31] [INFO ] Deduced a trap composed of 33 places in 513 ms of which 6 ms to minimize.
[2024-05-22 07:22:31] [INFO ] Deduced a trap composed of 36 places in 509 ms of which 7 ms to minimize.
[2024-05-22 07:22:32] [INFO ] Deduced a trap composed of 35 places in 509 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:22:33] [INFO ] Deduced a trap composed of 33 places in 548 ms of which 7 ms to minimize.
[2024-05-22 07:22:33] [INFO ] Deduced a trap composed of 33 places in 536 ms of which 7 ms to minimize.
[2024-05-22 07:22:34] [INFO ] Deduced a trap composed of 33 places in 508 ms of which 6 ms to minimize.
[2024-05-22 07:22:34] [INFO ] Deduced a trap composed of 33 places in 523 ms of which 8 ms to minimize.
[2024-05-22 07:22:35] [INFO ] Deduced a trap composed of 33 places in 479 ms of which 6 ms to minimize.
[2024-05-22 07:22:35] [INFO ] Deduced a trap composed of 38 places in 499 ms of which 7 ms to minimize.
[2024-05-22 07:22:36] [INFO ] Deduced a trap composed of 34 places in 476 ms of which 6 ms to minimize.
[2024-05-22 07:22:36] [INFO ] Deduced a trap composed of 37 places in 507 ms of which 7 ms to minimize.
[2024-05-22 07:22:37] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 5 ms to minimize.
[2024-05-22 07:22:37] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 6 ms to minimize.
[2024-05-22 07:22:38] [INFO ] Deduced a trap composed of 38 places in 436 ms of which 6 ms to minimize.
[2024-05-22 07:22:38] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 6 ms to minimize.
[2024-05-22 07:22:39] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 6 ms to minimize.
[2024-05-22 07:22:39] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 7 ms to minimize.
[2024-05-22 07:22:39] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 6 ms to minimize.
[2024-05-22 07:22:40] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 6 ms to minimize.
[2024-05-22 07:22:40] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 7 ms to minimize.
[2024-05-22 07:22:41] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:22:41] [INFO ] Deduced a trap composed of 33 places in 403 ms of which 6 ms to minimize.
[2024-05-22 07:22:42] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:22:42] [INFO ] Deduced a trap composed of 33 places in 481 ms of which 6 ms to minimize.
[2024-05-22 07:22:43] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 6 ms to minimize.
[2024-05-22 07:22:43] [INFO ] Deduced a trap composed of 33 places in 424 ms of which 6 ms to minimize.
[2024-05-22 07:22:43] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 5 ms to minimize.
[2024-05-22 07:22:44] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 6 ms to minimize.
[2024-05-22 07:22:44] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 8 ms to minimize.
[2024-05-22 07:22:45] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 6 ms to minimize.
[2024-05-22 07:22:45] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 6 ms to minimize.
[2024-05-22 07:22:46] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 6 ms to minimize.
[2024-05-22 07:22:46] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 6 ms to minimize.
[2024-05-22 07:22:47] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 6 ms to minimize.
[2024-05-22 07:22:47] [INFO ] Deduced a trap composed of 33 places in 509 ms of which 7 ms to minimize.
[2024-05-22 07:22:48] [INFO ] Deduced a trap composed of 33 places in 513 ms of which 6 ms to minimize.
[2024-05-22 07:22:48] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 7 ms to minimize.
[2024-05-22 07:22:49] [INFO ] Deduced a trap composed of 33 places in 506 ms of which 7 ms to minimize.
[2024-05-22 07:22:49] [INFO ] Deduced a trap composed of 44 places in 507 ms of which 6 ms to minimize.
[2024-05-22 07:22:50] [INFO ] Deduced a trap composed of 33 places in 506 ms of which 7 ms to minimize.
[2024-05-22 07:22:50] [INFO ] Deduced a trap composed of 33 places in 505 ms of which 6 ms to minimize.
[2024-05-22 07:22:51] [INFO ] Deduced a trap composed of 40 places in 491 ms of which 6 ms to minimize.
[2024-05-22 07:22:51] [INFO ] Deduced a trap composed of 33 places in 462 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:22:52] [INFO ] Deduced a trap composed of 33 places in 473 ms of which 6 ms to minimize.
[2024-05-22 07:22:52] [INFO ] Deduced a trap composed of 33 places in 484 ms of which 6 ms to minimize.
[2024-05-22 07:22:53] [INFO ] Deduced a trap composed of 34 places in 497 ms of which 6 ms to minimize.
[2024-05-22 07:22:53] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 7 ms to minimize.
[2024-05-22 07:22:54] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-05-22 07:22:54] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 6 ms to minimize.
[2024-05-22 07:22:55] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 6 ms to minimize.
[2024-05-22 07:22:55] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 6 ms to minimize.
[2024-05-22 07:22:56] [INFO ] Deduced a trap composed of 36 places in 441 ms of which 6 ms to minimize.
[2024-05-22 07:22:56] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 7 ms to minimize.
[2024-05-22 07:22:57] [INFO ] Deduced a trap composed of 34 places in 424 ms of which 6 ms to minimize.
[2024-05-22 07:22:57] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 6 ms to minimize.
[2024-05-22 07:22:57] [INFO ] Deduced a trap composed of 34 places in 384 ms of which 6 ms to minimize.
[2024-05-22 07:22:58] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 6 ms to minimize.
[2024-05-22 07:22:58] [INFO ] Deduced a trap composed of 34 places in 393 ms of which 6 ms to minimize.
[2024-05-22 07:22:59] [INFO ] Deduced a trap composed of 36 places in 383 ms of which 6 ms to minimize.
[2024-05-22 07:22:59] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2024-05-22 07:22:59] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 6 ms to minimize.
[2024-05-22 07:23:00] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 5 ms to minimize.
[2024-05-22 07:23:00] [INFO ] Deduced a trap composed of 36 places in 379 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1002 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:01] [INFO ] Deduced a trap composed of 33 places in 403 ms of which 6 ms to minimize.
[2024-05-22 07:23:01] [INFO ] Deduced a trap composed of 34 places in 384 ms of which 6 ms to minimize.
[2024-05-22 07:23:01] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 6 ms to minimize.
[2024-05-22 07:23:02] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 6 ms to minimize.
[2024-05-22 07:23:02] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 5 ms to minimize.
[2024-05-22 07:23:03] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 6 ms to minimize.
[2024-05-22 07:23:03] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 6 ms to minimize.
[2024-05-22 07:23:03] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 6 ms to minimize.
[2024-05-22 07:23:04] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-22 07:23:04] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 5 ms to minimize.
[2024-05-22 07:23:04] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 5 ms to minimize.
[2024-05-22 07:23:05] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-22 07:23:05] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 5 ms to minimize.
[2024-05-22 07:23:05] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 5 ms to minimize.
SMT process timed out in 46599ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 1875/1875 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1003 transition count 1873
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1003 transition count 1873
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1002 transition count 1872
Applied a total of 4 rules in 136 ms. Remains 1002 /1004 variables (removed 2) and now considering 1872/1875 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 1002/1004 places, 1872/1875 transitions.
RANDOM walk for 40000 steps (190 resets) in 415 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175003 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175003 steps, saw 45437 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1872 rows 1002 cols
[2024-05-22 07:23:09] [INFO ] Computed 33 invariants in 19 ms
[2024-05-22 07:23:09] [INFO ] State equation strengthened by 1773 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 968/980 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/980 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 20/1000 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/1001 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1872/2873 variables, 1001/1034 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2873 variables, 1773/2807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2873 variables, 0/2807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/2874 variables, 1/2808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2874 variables, 0/2808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2874 variables, 0/2808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2874/2874 variables, and 2808 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1002/1002 constraints, ReadFeed: 1773/1773 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 968/980 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/980 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:10] [INFO ] Deduced a trap composed of 2 places in 325 ms of which 4 ms to minimize.
[2024-05-22 07:23:11] [INFO ] Deduced a trap composed of 2 places in 366 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/1000 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:12] [INFO ] Deduced a trap composed of 33 places in 539 ms of which 7 ms to minimize.
[2024-05-22 07:23:12] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 6 ms to minimize.
[2024-05-22 07:23:13] [INFO ] Deduced a trap composed of 33 places in 518 ms of which 7 ms to minimize.
[2024-05-22 07:23:13] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 6 ms to minimize.
[2024-05-22 07:23:14] [INFO ] Deduced a trap composed of 33 places in 501 ms of which 6 ms to minimize.
[2024-05-22 07:23:14] [INFO ] Deduced a trap composed of 33 places in 469 ms of which 7 ms to minimize.
[2024-05-22 07:23:14] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 6 ms to minimize.
[2024-05-22 07:23:15] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 6 ms to minimize.
[2024-05-22 07:23:15] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 6 ms to minimize.
[2024-05-22 07:23:16] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 6 ms to minimize.
[2024-05-22 07:23:16] [INFO ] Deduced a trap composed of 38 places in 441 ms of which 6 ms to minimize.
[2024-05-22 07:23:17] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 6 ms to minimize.
[2024-05-22 07:23:17] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 6 ms to minimize.
[2024-05-22 07:23:18] [INFO ] Deduced a trap composed of 33 places in 506 ms of which 6 ms to minimize.
[2024-05-22 07:23:18] [INFO ] Deduced a trap composed of 33 places in 478 ms of which 6 ms to minimize.
[2024-05-22 07:23:19] [INFO ] Deduced a trap composed of 35 places in 482 ms of which 7 ms to minimize.
[2024-05-22 07:23:19] [INFO ] Deduced a trap composed of 34 places in 487 ms of which 6 ms to minimize.
[2024-05-22 07:23:20] [INFO ] Deduced a trap composed of 35 places in 490 ms of which 6 ms to minimize.
[2024-05-22 07:23:20] [INFO ] Deduced a trap composed of 35 places in 483 ms of which 7 ms to minimize.
[2024-05-22 07:23:21] [INFO ] Deduced a trap composed of 35 places in 490 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:21] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 7 ms to minimize.
[2024-05-22 07:23:22] [INFO ] Deduced a trap composed of 34 places in 487 ms of which 6 ms to minimize.
[2024-05-22 07:23:22] [INFO ] Deduced a trap composed of 33 places in 454 ms of which 6 ms to minimize.
[2024-05-22 07:23:23] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 7 ms to minimize.
[2024-05-22 07:23:23] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 6 ms to minimize.
[2024-05-22 07:23:24] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 7 ms to minimize.
[2024-05-22 07:23:24] [INFO ] Deduced a trap composed of 34 places in 455 ms of which 6 ms to minimize.
[2024-05-22 07:23:25] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 6 ms to minimize.
[2024-05-22 07:23:25] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 6 ms to minimize.
[2024-05-22 07:23:25] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 6 ms to minimize.
[2024-05-22 07:23:26] [INFO ] Deduced a trap composed of 36 places in 416 ms of which 6 ms to minimize.
[2024-05-22 07:23:26] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 6 ms to minimize.
[2024-05-22 07:23:27] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 6 ms to minimize.
[2024-05-22 07:23:27] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 6 ms to minimize.
[2024-05-22 07:23:28] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 6 ms to minimize.
[2024-05-22 07:23:28] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 6 ms to minimize.
[2024-05-22 07:23:28] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 6 ms to minimize.
[2024-05-22 07:23:29] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 6 ms to minimize.
[2024-05-22 07:23:29] [INFO ] Deduced a trap composed of 33 places in 408 ms of which 6 ms to minimize.
[2024-05-22 07:23:30] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:30] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 5 ms to minimize.
[2024-05-22 07:23:31] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 6 ms to minimize.
[2024-05-22 07:23:31] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 6 ms to minimize.
[2024-05-22 07:23:31] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 6 ms to minimize.
[2024-05-22 07:23:32] [INFO ] Deduced a trap composed of 33 places in 428 ms of which 7 ms to minimize.
[2024-05-22 07:23:32] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 7 ms to minimize.
[2024-05-22 07:23:33] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 6 ms to minimize.
[2024-05-22 07:23:33] [INFO ] Deduced a trap composed of 38 places in 382 ms of which 6 ms to minimize.
[2024-05-22 07:23:34] [INFO ] Deduced a trap composed of 33 places in 436 ms of which 6 ms to minimize.
[2024-05-22 07:23:34] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 6 ms to minimize.
[2024-05-22 07:23:34] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 7 ms to minimize.
[2024-05-22 07:23:35] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 7 ms to minimize.
[2024-05-22 07:23:35] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-22 07:23:36] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 7 ms to minimize.
[2024-05-22 07:23:36] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 6 ms to minimize.
[2024-05-22 07:23:36] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 6 ms to minimize.
[2024-05-22 07:23:37] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 5 ms to minimize.
[2024-05-22 07:23:37] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 5 ms to minimize.
[2024-05-22 07:23:38] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 6 ms to minimize.
[2024-05-22 07:23:38] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:39] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 6 ms to minimize.
[2024-05-22 07:23:39] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:23:39] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 6 ms to minimize.
[2024-05-22 07:23:40] [INFO ] Deduced a trap composed of 39 places in 397 ms of which 6 ms to minimize.
[2024-05-22 07:23:40] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 5 ms to minimize.
[2024-05-22 07:23:40] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 6 ms to minimize.
[2024-05-22 07:23:41] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 6 ms to minimize.
[2024-05-22 07:23:41] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-22 07:23:42] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 8 ms to minimize.
[2024-05-22 07:23:42] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 5 ms to minimize.
[2024-05-22 07:23:42] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 5 ms to minimize.
[2024-05-22 07:23:43] [INFO ] Deduced a trap composed of 37 places in 359 ms of which 5 ms to minimize.
[2024-05-22 07:23:43] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 6 ms to minimize.
[2024-05-22 07:23:44] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 6 ms to minimize.
[2024-05-22 07:23:44] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 5 ms to minimize.
[2024-05-22 07:23:44] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 5 ms to minimize.
[2024-05-22 07:23:45] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 6 ms to minimize.
[2024-05-22 07:23:45] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 7 ms to minimize.
[2024-05-22 07:23:45] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 5 ms to minimize.
[2024-05-22 07:23:46] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:46] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 6 ms to minimize.
[2024-05-22 07:23:46] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 5 ms to minimize.
[2024-05-22 07:23:47] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 5 ms to minimize.
[2024-05-22 07:23:47] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 6 ms to minimize.
[2024-05-22 07:23:47] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 5 ms to minimize.
[2024-05-22 07:23:48] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 6 ms to minimize.
[2024-05-22 07:23:48] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 6 ms to minimize.
[2024-05-22 07:23:49] [INFO ] Deduced a trap composed of 41 places in 436 ms of which 6 ms to minimize.
[2024-05-22 07:23:49] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 7 ms to minimize.
[2024-05-22 07:23:50] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 6 ms to minimize.
[2024-05-22 07:23:50] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 5 ms to minimize.
[2024-05-22 07:23:50] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 6 ms to minimize.
[2024-05-22 07:23:51] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 6 ms to minimize.
[2024-05-22 07:23:51] [INFO ] Deduced a trap composed of 38 places in 451 ms of which 6 ms to minimize.
[2024-05-22 07:23:52] [INFO ] Deduced a trap composed of 38 places in 496 ms of which 7 ms to minimize.
[2024-05-22 07:23:52] [INFO ] Deduced a trap composed of 37 places in 482 ms of which 6 ms to minimize.
[2024-05-22 07:23:53] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 6 ms to minimize.
[2024-05-22 07:23:53] [INFO ] Deduced a trap composed of 33 places in 489 ms of which 6 ms to minimize.
[2024-05-22 07:23:54] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 6 ms to minimize.
[2024-05-22 07:23:54] [INFO ] Deduced a trap composed of 42 places in 448 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:23:55] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 6 ms to minimize.
[2024-05-22 07:23:55] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 6 ms to minimize.
[2024-05-22 07:23:55] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 5 ms to minimize.
[2024-05-22 07:23:56] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 5 ms to minimize.
[2024-05-22 07:23:56] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 5 ms to minimize.
[2024-05-22 07:23:57] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 5 ms to minimize.
[2024-05-22 07:23:57] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 6 ms to minimize.
[2024-05-22 07:23:57] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 5 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 5 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 5 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-22 07:23:59] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 5 ms to minimize.
[2024-05-22 07:23:59] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 5 ms to minimize.
[2024-05-22 07:23:59] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 5 ms to minimize.
[2024-05-22 07:23:59] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 5 ms to minimize.
[2024-05-22 07:24:00] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 5 ms to minimize.
[2024-05-22 07:24:00] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 6 ms to minimize.
[2024-05-22 07:24:00] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 5 ms to minimize.
[2024-05-22 07:24:01] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 5 ms to minimize.
[2024-05-22 07:24:01] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:01] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-22 07:24:02] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 5 ms to minimize.
[2024-05-22 07:24:02] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:24:02] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 5 ms to minimize.
[2024-05-22 07:24:03] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 6 ms to minimize.
[2024-05-22 07:24:03] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-05-22 07:24:03] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 5 ms to minimize.
[2024-05-22 07:24:04] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:04] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 5 ms to minimize.
[2024-05-22 07:24:04] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:05] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 5 ms to minimize.
[2024-05-22 07:24:05] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 5 ms to minimize.
[2024-05-22 07:24:05] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 5 ms to minimize.
[2024-05-22 07:24:05] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 4 ms to minimize.
[2024-05-22 07:24:06] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 5 ms to minimize.
[2024-05-22 07:24:06] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:24:06] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:24:07] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:24:07] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 5 ms to minimize.
[2024-05-22 07:24:07] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1000 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 4 ms to minimize.
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 4 ms to minimize.
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 5 ms to minimize.
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 4 ms to minimize.
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 4 ms to minimize.
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 4 ms to minimize.
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 5 ms to minimize.
[2024-05-22 07:24:10] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 7 ms to minimize.
[2024-05-22 07:24:10] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 4 ms to minimize.
[2024-05-22 07:24:10] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 4 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 4 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 4 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
[2024-05-22 07:24:12] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 4 ms to minimize.
[2024-05-22 07:24:12] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-05-22 07:24:12] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-22 07:24:12] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 4 ms to minimize.
[2024-05-22 07:24:13] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1000 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:13] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 4 ms to minimize.
[2024-05-22 07:24:13] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 4 ms to minimize.
[2024-05-22 07:24:13] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
[2024-05-22 07:24:14] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
[2024-05-22 07:24:14] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:24:14] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 4 ms to minimize.
[2024-05-22 07:24:14] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:24:14] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 4 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 4 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 4 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 4 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1000 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 4 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 4 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 4 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 4 ms to minimize.
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 4 ms to minimize.
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 4 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1000 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 4 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 4 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 4 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 4 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 4 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 4 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 4 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 4 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 4 ms to minimize.
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1000 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 5 ms to minimize.
SMT process timed out in 76509ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1872/1872 transitions.
Applied a total of 0 rules in 54 ms. Remains 1002 /1002 variables (removed 0) and now considering 1872/1872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1002/1002 places, 1872/1872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1872/1872 transitions.
Applied a total of 0 rules in 53 ms. Remains 1002 /1002 variables (removed 0) and now considering 1872/1872 (removed 0) transitions.
[2024-05-22 07:24:25] [INFO ] Invariant cache hit.
[2024-05-22 07:24:26] [INFO ] Implicit Places using invariants in 613 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 615 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1001/1002 places, 1872/1872 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 999 transition count 1870
Applied a total of 4 rules in 91 ms. Remains 999 /1001 variables (removed 2) and now considering 1870/1872 (removed 2) transitions.
// Phase 1: matrix 1870 rows 999 cols
[2024-05-22 07:24:26] [INFO ] Computed 32 invariants in 11 ms
[2024-05-22 07:24:27] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-22 07:24:27] [INFO ] Invariant cache hit.
[2024-05-22 07:24:27] [INFO ] State equation strengthened by 1771 read => feed constraints.
[2024-05-22 07:24:33] [INFO ] Implicit Places using invariants and state equation in 6151 ms returned []
Implicit Place search using SMT with State Equation took 6750 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 999/1002 places, 1870/1872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7526 ms. Remains : 999/1002 places, 1870/1872 transitions.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-030-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:24:33] [INFO ] Flatten gal took : 68 ms
[2024-05-22 07:24:33] [INFO ] Flatten gal took : 66 ms
[2024-05-22 07:24:33] [INFO ] Input system was already deterministic with 2246 transitions.
Support contains 79 out of 1326 places (down from 85) after GAL structural reductions.
Computed a total of 99 stabilizing places and 128 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1326 transition count 2059
Reduce places removed 187 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 188 rules applied. Total rules applied 375 place count 1139 transition count 2058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 1138 transition count 2058
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 376 place count 1138 transition count 2031
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 430 place count 1111 transition count 2031
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 482 place count 1059 transition count 1927
Iterating global reduction 3 with 52 rules applied. Total rules applied 534 place count 1059 transition count 1927
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 3 with 26 rules applied. Total rules applied 560 place count 1059 transition count 1901
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 586 place count 1033 transition count 1901
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 640 place count 1006 transition count 1874
Applied a total of 640 rules in 224 ms. Remains 1006 /1326 variables (removed 320) and now considering 1874/2246 (removed 372) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 225 ms. Remains : 1006/1326 places, 1874/2246 transitions.
[2024-05-22 07:24:33] [INFO ] Flatten gal took : 44 ms
[2024-05-22 07:24:33] [INFO ] Flatten gal took : 49 ms
[2024-05-22 07:24:33] [INFO ] Input system was already deterministic with 1874 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2136
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2136
Applied a total of 116 rules in 107 ms. Remains 1268 /1326 variables (removed 58) and now considering 2136/2246 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1268/1326 places, 2136/2246 transitions.
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 46 ms
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 50 ms
[2024-05-22 07:24:34] [INFO ] Input system was already deterministic with 2136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1326 transition count 2053
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 1 with 193 rules applied. Total rules applied 386 place count 1133 transition count 2053
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 386 place count 1133 transition count 2025
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 442 place count 1105 transition count 2025
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 494 place count 1053 transition count 1921
Iterating global reduction 2 with 52 rules applied. Total rules applied 546 place count 1053 transition count 1921
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 2 with 28 rules applied. Total rules applied 574 place count 1053 transition count 1893
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 602 place count 1025 transition count 1893
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 652 place count 1000 transition count 1868
Applied a total of 652 rules in 155 ms. Remains 1000 /1326 variables (removed 326) and now considering 1868/2246 (removed 378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 156 ms. Remains : 1000/1326 places, 1868/2246 transitions.
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 48 ms
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 47 ms
[2024-05-22 07:24:34] [INFO ] Input system was already deterministic with 1868 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 1267 transition count 2134
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 1267 transition count 2134
Applied a total of 118 rules in 81 ms. Remains 1267 /1326 variables (removed 59) and now considering 2134/2246 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 1267/1326 places, 2134/2246 transitions.
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:24:34] [INFO ] Flatten gal took : 44 ms
[2024-05-22 07:24:34] [INFO ] Input system was already deterministic with 2134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1266 transition count 2132
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1266 transition count 2132
Applied a total of 120 rules in 66 ms. Remains 1266 /1326 variables (removed 60) and now considering 2132/2246 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1266/1326 places, 2132/2246 transitions.
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 45 ms
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 45 ms
[2024-05-22 07:24:35] [INFO ] Input system was already deterministic with 2132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1326 transition count 2054
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 1134 transition count 2054
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 384 place count 1134 transition count 2026
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 440 place count 1106 transition count 2026
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 491 place count 1055 transition count 1924
Iterating global reduction 2 with 51 rules applied. Total rules applied 542 place count 1055 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 26 rules applied. Total rules applied 568 place count 1055 transition count 1898
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 594 place count 1029 transition count 1898
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 646 place count 1003 transition count 1872
Applied a total of 646 rules in 160 ms. Remains 1003 /1326 variables (removed 323) and now considering 1872/2246 (removed 374) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 1003/1326 places, 1872/2246 transitions.
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 41 ms
[2024-05-22 07:24:35] [INFO ] Input system was already deterministic with 1872 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1273 transition count 2144
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1273 transition count 2144
Applied a total of 106 rules in 66 ms. Remains 1273 /1326 variables (removed 53) and now considering 2144/2246 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1273/1326 places, 2144/2246 transitions.
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 45 ms
[2024-05-22 07:24:35] [INFO ] Input system was already deterministic with 2144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2135
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2135
Applied a total of 116 rules in 65 ms. Remains 1268 /1326 variables (removed 58) and now considering 2135/2246 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 1268/1326 places, 2135/2246 transitions.
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 36 ms
[2024-05-22 07:24:35] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:24:36] [INFO ] Input system was already deterministic with 2135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1266 transition count 2132
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1266 transition count 2132
Applied a total of 120 rules in 64 ms. Remains 1266 /1326 variables (removed 60) and now considering 2132/2246 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1266/1326 places, 2132/2246 transitions.
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 43 ms
[2024-05-22 07:24:36] [INFO ] Input system was already deterministic with 2132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 1269 transition count 2138
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 1269 transition count 2138
Applied a total of 114 rules in 85 ms. Remains 1269 /1326 variables (removed 57) and now considering 2138/2246 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1269/1326 places, 2138/2246 transitions.
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 45 ms
[2024-05-22 07:24:36] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1326 transition count 2053
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 1 with 193 rules applied. Total rules applied 386 place count 1133 transition count 2053
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 386 place count 1133 transition count 2025
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 442 place count 1105 transition count 2025
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 495 place count 1052 transition count 1919
Iterating global reduction 2 with 53 rules applied. Total rules applied 548 place count 1052 transition count 1919
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 2 with 28 rules applied. Total rules applied 576 place count 1052 transition count 1891
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 604 place count 1024 transition count 1891
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 654 place count 999 transition count 1866
Applied a total of 654 rules in 155 ms. Remains 999 /1326 variables (removed 327) and now considering 1866/2246 (removed 380) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 999/1326 places, 1866/2246 transitions.
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 33 ms
[2024-05-22 07:24:36] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:24:36] [INFO ] Input system was already deterministic with 1866 transitions.
RANDOM walk for 6823 steps (31 resets) in 71 ms. (94 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-030-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 1268 transition count 2136
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 1268 transition count 2136
Applied a total of 116 rules in 66 ms. Remains 1268 /1326 variables (removed 58) and now considering 2136/2246 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1268/1326 places, 2136/2246 transitions.
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 35 ms
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:24:37] [INFO ] Input system was already deterministic with 2136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1275 transition count 2150
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1275 transition count 2150
Applied a total of 102 rules in 66 ms. Remains 1275 /1326 variables (removed 51) and now considering 2150/2246 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1275/1326 places, 2150/2246 transitions.
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 36 ms
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:24:37] [INFO ] Input system was already deterministic with 2150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1326/1326 places, 2246/2246 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1273 transition count 2145
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1273 transition count 2145
Applied a total of 106 rules in 63 ms. Remains 1273 /1326 variables (removed 53) and now considering 2145/2246 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1273/1326 places, 2145/2246 transitions.
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 34 ms
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:24:37] [INFO ] Input system was already deterministic with 2145 transitions.
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:24:37] [INFO ] Flatten gal took : 41 ms
[2024-05-22 07:24:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 07:24:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1326 places, 2246 transitions and 8106 arcs took 13 ms.
Total runtime 160384 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANConstruction-PT-030
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1326
TRANSITIONS: 2246
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.003s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1576
MODEL NAME: /home/mcc/execution/416/model
1326 places, 2246 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-030"
export BK_EXAMINATION="CTLCardinality"
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 CTLCardinality"
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-171620503600025"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;