Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
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-CTLFireability-2024-00
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-01
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-02
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-03
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-04
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-05
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-06
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-07
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-08
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-09
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-10
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-11
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-12
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-13
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-14
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717178293153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 17:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:58:14] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-31 17:58:14] [INFO ] Transformed 2162 places.
[2024-05-31 17:58:14] [INFO ] Transformed 3840 transitions.
[2024-05-31 17:58:14] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 119 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 792 places :
Symmetric choice reduction at 0 with 792 rule applications. Total rules 792 place count 1370 transition count 2256
Iterating global reduction 0 with 792 rules applied. Total rules applied 1584 place count 1370 transition count 2256
Applied a total of 1584 rules in 268 ms. Remains 1370 /2162 variables (removed 792) and now considering 2256/3840 (removed 1584) transitions.
// Phase 1: matrix 2256 rows 1370 cols
[2024-05-31 17:58:15] [INFO ] Computed 61 invariants in 40 ms
[2024-05-31 17:58:15] [INFO ] Implicit Places using invariants in 935 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 320, 334, 348, 362, 376, 404, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 968 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1342/2162 places, 2256/3840 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1314 transition count 2228
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1314 transition count 2228
Applied a total of 56 rules in 159 ms. Remains 1314 /1342 variables (removed 28) and now considering 2228/2256 (removed 28) transitions.
// Phase 1: matrix 2228 rows 1314 cols
[2024-05-31 17:58:16] [INFO ] Computed 33 invariants in 27 ms
[2024-05-31 17:58:16] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-31 17:58:16] [INFO ] Invariant cache hit.
[2024-05-31 17:58:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 17:58:23] [INFO ] Implicit Places using invariants and state equation in 6902 ms returned []
Implicit Place search using SMT with State Equation took 7637 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1314/2162 places, 2228/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9052 ms. Remains : 1314/2162 places, 2228/3840 transitions.
Support contains 119 out of 1314 places after structural reductions.
[2024-05-31 17:58:24] [INFO ] Flatten gal took : 164 ms
[2024-05-31 17:58:24] [INFO ] Flatten gal took : 103 ms
[2024-05-31 17:58:24] [INFO ] Input system was already deterministic with 2228 transitions.
RANDOM walk for 40000 steps (75 resets) in 3004 ms. (13 steps per ms) remains 5/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
[2024-05-31 17:58:25] [INFO ] Invariant cache hit.
[2024-05-31 17:58:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1276/1297 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1297 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/1311 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/1313 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2228/3541 variables, 1313/1346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3541 variables, 1770/3116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3541 variables, 0/3116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/3542 variables, 1/3117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3542 variables, 0/3117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3542 variables, 0/3117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3542/3542 variables, and 3117 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1314/1314 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1276/1297 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 5 places in 552 ms of which 55 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 7 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 3 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1297 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 4 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 4 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 7424ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 1314 transition count 2052
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 1 with 176 rules applied. Total rules applied 352 place count 1138 transition count 2052
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 352 place count 1138 transition count 2024
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 408 place count 1110 transition count 2024
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 452 place count 1066 transition count 1936
Iterating global reduction 2 with 44 rules applied. Total rules applied 496 place count 1066 transition count 1936
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 2 with 22 rules applied. Total rules applied 518 place count 1066 transition count 1914
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 540 place count 1044 transition count 1914
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 594 place count 1017 transition count 1887
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 598 place count 1017 transition count 1883
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 602 place count 1013 transition count 1883
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 607 place count 1013 transition count 1878
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 612 place count 1008 transition count 1878
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 622 place count 1008 transition count 1878
Applied a total of 622 rules in 634 ms. Remains 1008 /1314 variables (removed 306) and now considering 1878/2228 (removed 350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 635 ms. Remains : 1008/1314 places, 1878/2228 transitions.
RANDOM walk for 40000 steps (189 resets) in 823 ms. (48 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
// Phase 1: matrix 1878 rows 1008 cols
[2024-05-31 17:58:34] [INFO ] Computed 33 invariants in 12 ms
[2024-05-31 17:58:34] [INFO ] State equation strengthened by 1772 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 973/984 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/984 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 21/1005 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1005 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/1007 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1878/2885 variables, 1007/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2885 variables, 1772/2812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2885 variables, 0/2812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/2886 variables, 1/2813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2886 variables, 0/2813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2886 variables, 0/2813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2886/2886 variables, and 2813 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1008/1008 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 973/984 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:35] [INFO ] Deduced a trap composed of 2 places in 402 ms of which 5 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/984 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/984 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/1005 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 33 places in 478 ms of which 6 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 33 places in 479 ms of which 7 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 38 places in 432 ms of which 8 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 39 places in 467 ms of which 7 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 6 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 39 places in 449 ms of which 6 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 33 places in 460 ms of which 7 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 5 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 33 places in 454 ms of which 6 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 6 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 39 places in 480 ms of which 7 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 38 places in 466 ms of which 6 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 38 places in 478 ms of which 6 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 38 places in 486 ms of which 7 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 6 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 38 places in 471 ms of which 6 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 6 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 6 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 38 places in 467 ms of which 8 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1005 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 6 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 6 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 6 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 6 ms to minimize.
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 7 ms to minimize.
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 6 ms to minimize.
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 5 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 5 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 6 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 40 places in 361 ms of which 5 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 5 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 5 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 6 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 5 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 5 ms to minimize.
[2024-05-31 17:58:52] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 5 ms to minimize.
[2024-05-31 17:58:52] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 5 ms to minimize.
[2024-05-31 17:58:52] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 6 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 6 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 6 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 6 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 37 places in 361 ms of which 5 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 38 places in 392 ms of which 5 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 34 places in 383 ms of which 6 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 5 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 5 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 6 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 6 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 5 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 7 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 6 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 5 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 7 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 39 places in 378 ms of which 6 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 6 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 5 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 6 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1005 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 6 ms to minimize.
[2024-05-31 17:59:02] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 5 ms to minimize.
[2024-05-31 17:59:02] [INFO ] Deduced a trap composed of 38 places in 352 ms of which 6 ms to minimize.
[2024-05-31 17:59:02] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 5 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 5 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 6 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 33 places in 305 ms of which 5 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 5 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 5 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 34 places in 300 ms of which 5 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 34 places in 305 ms of which 6 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 5 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 6 ms to minimize.
[2024-05-31 17:59:06] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 6 ms to minimize.
[2024-05-31 17:59:06] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 6 ms to minimize.
[2024-05-31 17:59:06] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 5 ms to minimize.
[2024-05-31 17:59:07] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 5 ms to minimize.
[2024-05-31 17:59:07] [INFO ] Deduced a trap composed of 40 places in 609 ms of which 11 ms to minimize.
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 34 places in 354 ms of which 6 ms to minimize.
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1005 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:59:08] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 6 ms to minimize.
[2024-05-31 17:59:09] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-31 17:59:09] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 6 ms to minimize.
[2024-05-31 17:59:09] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 6 ms to minimize.
[2024-05-31 17:59:10] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 6 ms to minimize.
[2024-05-31 17:59:10] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 6 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 5 ms to minimize.
[2024-05-31 17:59:11] [INFO ] Deduced a trap composed of 34 places in 326 ms of which 5 ms to minimize.
[2024-05-31 17:59:12] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 5 ms to minimize.
[2024-05-31 17:59:12] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-31 17:59:12] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 6 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 5 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 5 ms to minimize.
[2024-05-31 17:59:13] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 5 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 5 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 6 ms to minimize.
[2024-05-31 17:59:14] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 6 ms to minimize.
[2024-05-31 17:59:15] [INFO ] Deduced a trap composed of 36 places in 325 ms of which 5 ms to minimize.
[2024-05-31 17:59:15] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1005 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 17:59:15] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 5 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 5 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 5 ms to minimize.
[2024-05-31 17:59:16] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 5 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 5 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 5 ms to minimize.
[2024-05-31 17:59:17] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 5 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 5 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 5 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 5 ms to minimize.
[2024-05-31 17:59:18] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 5 ms to minimize.
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 5 ms to minimize.
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 5 ms to minimize.
[2024-05-31 17:59:19] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 5 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 4 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 5 ms to minimize.
[2024-05-31 17:59:20] [INFO ] Deduced a trap composed of 34 places in 312 ms of which 5 ms to minimize.
SMT process timed out in 46499ms, 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 11 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1878/1878 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1008 transition count 1877
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1007 transition count 1876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1006 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 1005 transition count 1874
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 1005 transition count 1874
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 1002 transition count 1871
Applied a total of 12 rules in 151 ms. Remains 1002 /1008 variables (removed 6) and now considering 1871/1878 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 1002/1008 places, 1871/1878 transitions.
RANDOM walk for 40000 steps (191 resets) in 415 ms. (96 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
// Phase 1: matrix 1871 rows 1002 cols
[2024-05-31 17:59:21] [INFO ] Computed 33 invariants in 16 ms
[2024-05-31 17:59:21] [INFO ] State equation strengthened by 1772 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 969/974 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/999 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1001 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1871/2872 variables, 1001/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2872 variables, 1772/2806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2872 variables, 0/2806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2873 variables, 1/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2873 variables, 0/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2873 variables, 0/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2873/2873 variables, and 2807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1002/1002 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 969/974 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 2 places in 435 ms of which 6 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/999 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-31 17:59:22] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 4 ms to minimize.
[2024-05-31 17:59:23] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:59:23] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1001 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1871/2872 variables, 1001/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2872 variables, 1772/2813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2872 variables, 1/2814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2872 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2873 variables, 1/2815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2873 variables, 0/2815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2873 variables, 0/2815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2873/2873 variables, and 2815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1002/1002 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2895ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1871/1871 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1002 transition count 1870
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1001 transition count 1869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1000 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 998 transition count 1865
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 998 transition count 1865
Applied a total of 8 rules in 109 ms. Remains 998 /1002 variables (removed 4) and now considering 1865/1871 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 998/1002 places, 1865/1871 transitions.
RANDOM walk for 40000 steps (195 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239297 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239297 steps, saw 55370 distinct states, run finished after 3008 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 1865 rows 998 cols
[2024-05-31 17:59:27] [INFO ] Computed 33 invariants in 12 ms
[2024-05-31 17:59:27] [INFO ] State equation strengthened by 1772 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/995 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/995 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/997 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1865/2862 variables, 997/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 1772/2802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2863 variables, 1/2803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2863 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2863 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2803 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 998/998 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 2 places in 435 ms of which 6 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-31 17:59:28] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/970 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/995 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:29] [INFO ] Deduced a trap composed of 33 places in 494 ms of which 6 ms to minimize.
[2024-05-31 17:59:29] [INFO ] Deduced a trap composed of 33 places in 491 ms of which 6 ms to minimize.
[2024-05-31 17:59:30] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 5 ms to minimize.
[2024-05-31 17:59:30] [INFO ] Deduced a trap composed of 41 places in 470 ms of which 6 ms to minimize.
[2024-05-31 17:59:31] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 6 ms to minimize.
[2024-05-31 17:59:31] [INFO ] Deduced a trap composed of 33 places in 464 ms of which 6 ms to minimize.
[2024-05-31 17:59:32] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 6 ms to minimize.
[2024-05-31 17:59:32] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 6 ms to minimize.
[2024-05-31 17:59:33] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 6 ms to minimize.
[2024-05-31 17:59:33] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 6 ms to minimize.
[2024-05-31 17:59:34] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 6 ms to minimize.
[2024-05-31 17:59:34] [INFO ] Deduced a trap composed of 33 places in 428 ms of which 6 ms to minimize.
[2024-05-31 17:59:34] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 6 ms to minimize.
[2024-05-31 17:59:35] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 6 ms to minimize.
[2024-05-31 17:59:35] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 6 ms to minimize.
[2024-05-31 17:59:36] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 7 ms to minimize.
[2024-05-31 17:59:36] [INFO ] Deduced a trap composed of 38 places in 389 ms of which 6 ms to minimize.
[2024-05-31 17:59:37] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 6 ms to minimize.
[2024-05-31 17:59:37] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-31 17:59:37] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:38] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 6 ms to minimize.
[2024-05-31 17:59:38] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 6 ms to minimize.
[2024-05-31 17:59:39] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 6 ms to minimize.
[2024-05-31 17:59:39] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 6 ms to minimize.
[2024-05-31 17:59:39] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 6 ms to minimize.
[2024-05-31 17:59:40] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 6 ms to minimize.
[2024-05-31 17:59:40] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 6 ms to minimize.
[2024-05-31 17:59:41] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 6 ms to minimize.
[2024-05-31 17:59:41] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 6 ms to minimize.
[2024-05-31 17:59:41] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 5 ms to minimize.
[2024-05-31 17:59:42] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 6 ms to minimize.
[2024-05-31 17:59:42] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 5 ms to minimize.
[2024-05-31 17:59:42] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 5 ms to minimize.
[2024-05-31 17:59:43] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 5 ms to minimize.
[2024-05-31 17:59:43] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 6 ms to minimize.
[2024-05-31 17:59:43] [INFO ] Deduced a trap composed of 37 places in 325 ms of which 6 ms to minimize.
[2024-05-31 17:59:44] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 5 ms to minimize.
[2024-05-31 17:59:44] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 5 ms to minimize.
[2024-05-31 17:59:44] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 5 ms to minimize.
[2024-05-31 17:59:45] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:45] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 6 ms to minimize.
[2024-05-31 17:59:45] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 6 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 6 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 5 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 5 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 5 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 6 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 5 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 5 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 6 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 5 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 5 ms to minimize.
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 6 ms to minimize.
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 5 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 5 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 5 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/995 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/995 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/997 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1865/2862 variables, 997/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2862 variables, 1772/2863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2862 variables, 1/2864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2862 variables, 0/2864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2863 variables, 1/2865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2863 variables, 0/2865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2863 variables, 0/2865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2863/2863 variables, and 2865 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24000 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 998/998 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 61/61 constraints]
After SMT, in 24849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 1865/1865 transitions.
Applied a total of 0 rules in 48 ms. Remains 998 /998 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 998/998 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 1865/1865 transitions.
Applied a total of 0 rules in 47 ms. Remains 998 /998 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2024-05-31 17:59:52] [INFO ] Invariant cache hit.
[2024-05-31 17:59:52] [INFO ] Implicit Places using invariants in 521 ms returned [70, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 523 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 996/998 places, 1865/1865 transitions.
Applied a total of 0 rules in 50 ms. Remains 996 /996 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 621 ms. Remains : 996/998 places, 1865/1865 transitions.
RANDOM walk for 40000 steps (194 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264845 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264845 steps, saw 55801 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1865 rows 996 cols
[2024-05-31 17:59:55] [INFO ] Computed 31 invariants in 14 ms
[2024-05-31 17:59:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/995 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/995 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1865/2860 variables, 995/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2860 variables, 1770/2796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2860 variables, 0/2796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2861 variables, 1/2797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2861 variables, 0/2797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2861 variables, 0/2797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2861/2861 variables, and 2797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 996/996 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:57] [INFO ] Deduced a trap composed of 2 places in 381 ms of which 6 ms to minimize.
[2024-05-31 17:59:57] [INFO ] Deduced a trap composed of 2 places in 384 ms of which 6 ms to minimize.
[2024-05-31 17:59:57] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/970 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/995 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 17:59:58] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 6 ms to minimize.
[2024-05-31 17:59:58] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 6 ms to minimize.
[2024-05-31 17:59:59] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 6 ms to minimize.
[2024-05-31 17:59:59] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 6 ms to minimize.
[2024-05-31 17:59:59] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 6 ms to minimize.
[2024-05-31 18:00:00] [INFO ] Deduced a trap composed of 33 places in 436 ms of which 6 ms to minimize.
[2024-05-31 18:00:00] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 6 ms to minimize.
[2024-05-31 18:00:01] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 7 ms to minimize.
[2024-05-31 18:00:01] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 6 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 6 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 42 places in 457 ms of which 6 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 40 places in 429 ms of which 8 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 6 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 6 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 6 ms to minimize.
[2024-05-31 18:00:05] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 7 ms to minimize.
[2024-05-31 18:00:05] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 6 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 6 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/995 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 7 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 34 places in 411 ms of which 6 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 34 places in 421 ms of which 6 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 6 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 33 places in 395 ms of which 6 ms to minimize.
[2024-05-31 18:00:09] [INFO ] Deduced a trap composed of 33 places in 393 ms of which 7 ms to minimize.
[2024-05-31 18:00:09] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 6 ms to minimize.
[2024-05-31 18:00:10] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 6 ms to minimize.
[2024-05-31 18:00:10] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 6 ms to minimize.
[2024-05-31 18:00:10] [INFO ] Deduced a trap composed of 41 places in 379 ms of which 6 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 6 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 36 places in 371 ms of which 6 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 40 places in 376 ms of which 5 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 6 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 7 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 5 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 6 ms to minimize.
[2024-05-31 18:00:14] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 6 ms to minimize.
[2024-05-31 18:00:14] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 5 ms to minimize.
[2024-05-31 18:00:14] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 5 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 6 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 33 places in 343 ms of which 6 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 6 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 6 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 6 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 6 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 41 places in 360 ms of which 6 ms to minimize.
[2024-05-31 18:00:18] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 6 ms to minimize.
[2024-05-31 18:00:18] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 6 ms to minimize.
[2024-05-31 18:00:18] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 6 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 6 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 6 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 5 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 5 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 33 places in 334 ms of which 5 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 6 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 5 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 6 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/995 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:00:22] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 6 ms to minimize.
[2024-05-31 18:00:22] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 6 ms to minimize.
[2024-05-31 18:00:22] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 5 ms to minimize.
[2024-05-31 18:00:23] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 6 ms to minimize.
[2024-05-31 18:00:23] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 6 ms to minimize.
[2024-05-31 18:00:23] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 6 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 6 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 6 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 6 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 6 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 5 ms to minimize.
[2024-05-31 18:00:26] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 5 ms to minimize.
[2024-05-31 18:00:26] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/995 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1865/2860 variables, 995/1103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2860 variables, 1770/2873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2860 variables, 1/2874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2860 variables, 0/2874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2861 variables, 1/2875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2861 variables, 0/2875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2861 variables, 0/2875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2861/2861 variables, and 2875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30892 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 996/996 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 77/77 constraints]
After SMT, in 31624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 996 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 996/996 places, 1865/1865 transitions.
Applied a total of 0 rules in 47 ms. Remains 996 /996 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 996/996 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 996/996 places, 1865/1865 transitions.
Applied a total of 0 rules in 57 ms. Remains 996 /996 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2024-05-31 18:00:27] [INFO ] Invariant cache hit.
[2024-05-31 18:00:28] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-31 18:00:28] [INFO ] Invariant cache hit.
[2024-05-31 18:00:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 18:00:34] [INFO ] Implicit Places using invariants and state equation in 6711 ms returned []
Implicit Place search using SMT with State Equation took 7200 ms to find 0 implicit places.
[2024-05-31 18:00:34] [INFO ] Redundant transitions in 93 ms returned []
Running 1835 sub problems to find dead transitions.
[2024-05-31 18:00:34] [INFO ] Invariant cache hit.
[2024-05-31 18:00:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1835 unsolved
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 6 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 7 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 33 places in 437 ms of which 6 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 5 ms to minimize.
[2024-05-31 18:01:03] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 6 ms to minimize.
[2024-05-31 18:01:03] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 6 ms to minimize.
[2024-05-31 18:01:03] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 6 ms to minimize.
[2024-05-31 18:01:04] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 5 ms to minimize.
[2024-05-31 18:01:04] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
[2024-05-31 18:01:04] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 5 ms to minimize.
[2024-05-31 18:01:05] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 7 ms to minimize.
[2024-05-31 18:01:05] [INFO ] Deduced a trap composed of 39 places in 311 ms of which 6 ms to minimize.
[2024-05-31 18:01:05] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 5 ms to minimize.
[2024-05-31 18:01:06] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 5 ms to minimize.
SMT process timed out in 31304ms, After SMT, problems are : Problem set: 0 solved, 1835 unsolved
Search for dead transitions found 0 dead transitions in 31331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38697 ms. Remains : 996/996 places, 1865/1865 transitions.
[2024-05-31 18:01:06] [INFO ] Flatten gal took : 61 ms
[2024-05-31 18:01:06] [INFO ] Flatten gal took : 67 ms
[2024-05-31 18:01:06] [INFO ] Input system was already deterministic with 2228 transitions.
Computed a total of 93 stabilizing places and 122 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 112 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-31 18:01:06] [INFO ] Flatten gal took : 51 ms
[2024-05-31 18:01:06] [INFO ] Flatten gal took : 52 ms
[2024-05-31 18:01:06] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1273 transition count 2146
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1273 transition count 2146
Applied a total of 82 rules in 137 ms. Remains 1273 /1314 variables (removed 41) and now considering 2146/2228 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 1273/1314 places, 2146/2228 transitions.
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 44 ms
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 49 ms
[2024-05-31 18:01:07] [INFO ] Input system was already deterministic with 2146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 1314 transition count 2048
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 360 place count 1134 transition count 2048
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 360 place count 1134 transition count 2019
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 418 place count 1105 transition count 2019
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 465 place count 1058 transition count 1925
Iterating global reduction 2 with 47 rules applied. Total rules applied 512 place count 1058 transition count 1925
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 537 place count 1058 transition count 1900
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 562 place count 1033 transition count 1900
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 4 with 54 rules applied. Total rules applied 616 place count 1006 transition count 1873
Applied a total of 616 rules in 245 ms. Remains 1006 /1314 variables (removed 308) and now considering 1873/2228 (removed 355) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 246 ms. Remains : 1006/1314 places, 1873/2228 transitions.
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 44 ms
[2024-05-31 18:01:07] [INFO ] Input system was already deterministic with 1873 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1273 transition count 2146
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1273 transition count 2146
Applied a total of 82 rules in 107 ms. Remains 1273 /1314 variables (removed 41) and now considering 2146/2228 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1273/1314 places, 2146/2228 transitions.
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:07] [INFO ] Flatten gal took : 43 ms
[2024-05-31 18:01:07] [INFO ] Input system was already deterministic with 2146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 424 place count 1102 transition count 2016
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 470 place count 1056 transition count 1924
Iterating global reduction 2 with 46 rules applied. Total rules applied 516 place count 1056 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 24 rules applied. Total rules applied 540 place count 1056 transition count 1900
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 564 place count 1032 transition count 1900
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 628 place count 1000 transition count 1868
Applied a total of 628 rules in 227 ms. Remains 1000 /1314 variables (removed 314) and now considering 1868/2228 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 1000/1314 places, 1868/2228 transitions.
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:08] [INFO ] Input system was already deterministic with 1868 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1267 transition count 2134
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1267 transition count 2134
Applied a total of 94 rules in 84 ms. Remains 1267 /1314 variables (removed 47) and now considering 2134/2228 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1267/1314 places, 2134/2228 transitions.
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 36 ms
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 40 ms
[2024-05-31 18:01:08] [INFO ] Input system was already deterministic with 2134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 84 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:08] [INFO ] Flatten gal took : 43 ms
[2024-05-31 18:01:08] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1271 transition count 2142
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1271 transition count 2142
Applied a total of 86 rules in 125 ms. Remains 1271 /1314 variables (removed 43) and now considering 2142/2228 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 1271/1314 places, 2142/2228 transitions.
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 41 ms
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 50 ms
[2024-05-31 18:01:09] [INFO ] Input system was already deterministic with 2142 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 1314 transition count 2047
Reduce places removed 181 places and 0 transitions.
Iterating post reduction 1 with 181 rules applied. Total rules applied 362 place count 1133 transition count 2047
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 362 place count 1133 transition count 2019
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 418 place count 1105 transition count 2019
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 465 place count 1058 transition count 1925
Iterating global reduction 2 with 47 rules applied. Total rules applied 512 place count 1058 transition count 1925
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 538 place count 1058 transition count 1899
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 564 place count 1032 transition count 1899
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 4 with 54 rules applied. Total rules applied 618 place count 1005 transition count 1872
Applied a total of 618 rules in 155 ms. Remains 1005 /1314 variables (removed 309) and now considering 1872/2228 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 1005/1314 places, 1872/2228 transitions.
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 33 ms
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 37 ms
[2024-05-31 18:01:09] [INFO ] Input system was already deterministic with 1872 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 86 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 37 ms
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 42 ms
[2024-05-31 18:01:09] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1274 transition count 2148
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1274 transition count 2148
Applied a total of 80 rules in 109 ms. Remains 1274 /1314 variables (removed 40) and now considering 2148/2228 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1274/1314 places, 2148/2228 transitions.
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 36 ms
[2024-05-31 18:01:09] [INFO ] Flatten gal took : 41 ms
[2024-05-31 18:01:10] [INFO ] Input system was already deterministic with 2148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
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 424 place count 1102 transition count 2016
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 471 place count 1055 transition count 1922
Iterating global reduction 2 with 47 rules applied. Total rules applied 518 place count 1055 transition count 1922
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 543 place count 1055 transition count 1897
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 568 place count 1030 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 630 place count 999 transition count 1866
Applied a total of 630 rules in 153 ms. Remains 999 /1314 variables (removed 315) and now considering 1866/2228 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 154 ms. Remains : 999/1314 places, 1866/2228 transitions.
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 33 ms
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 37 ms
[2024-05-31 18:01:10] [INFO ] Input system was already deterministic with 1866 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 424 place count 1102 transition count 2016
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 471 place count 1055 transition count 1922
Iterating global reduction 2 with 47 rules applied. Total rules applied 518 place count 1055 transition count 1922
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 543 place count 1055 transition count 1897
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 568 place count 1030 transition count 1897
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 628 place count 1000 transition count 1867
Applied a total of 628 rules in 146 ms. Remains 1000 /1314 variables (removed 314) and now considering 1867/2228 (removed 361) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 146 ms. Remains : 1000/1314 places, 1867/2228 transitions.
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 32 ms
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 38 ms
[2024-05-31 18:01:10] [INFO ] Input system was already deterministic with 1867 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1314 transition count 2046
Reduce places removed 182 places and 0 transitions.
Iterating post reduction 1 with 182 rules applied. Total rules applied 364 place count 1132 transition count 2046
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 364 place count 1132 transition count 2018
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 420 place count 1104 transition count 2018
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 467 place count 1057 transition count 1924
Iterating global reduction 2 with 47 rules applied. Total rules applied 514 place count 1057 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 539 place count 1057 transition count 1899
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 564 place count 1032 transition count 1899
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 620 place count 1004 transition count 1871
Applied a total of 620 rules in 187 ms. Remains 1004 /1314 variables (removed 310) and now considering 1871/2228 (removed 357) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 1004/1314 places, 1871/2228 transitions.
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 34 ms
[2024-05-31 18:01:10] [INFO ] Flatten gal took : 41 ms
[2024-05-31 18:01:11] [INFO ] Input system was already deterministic with 1871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1271 transition count 2142
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1271 transition count 2142
Applied a total of 86 rules in 105 ms. Remains 1271 /1314 variables (removed 43) and now considering 2142/2228 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 1271/1314 places, 2142/2228 transitions.
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 37 ms
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 44 ms
[2024-05-31 18:01:11] [INFO ] Input system was already deterministic with 2142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1268 transition count 2136
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1268 transition count 2136
Applied a total of 92 rules in 83 ms. Remains 1268 /1314 variables (removed 46) and now considering 2136/2228 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1268/1314 places, 2136/2228 transitions.
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 35 ms
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 39 ms
[2024-05-31 18:01:11] [INFO ] Input system was already deterministic with 2136 transitions.
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 41 ms
[2024-05-31 18:01:11] [INFO ] Flatten gal took : 42 ms
[2024-05-31 18:01:11] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 18:01:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1314 places, 2228 transitions and 8064 arcs took 18 ms.
Total runtime 177399 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-00
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-01
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-02
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-03
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-04
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-05
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-06
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-07
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-08
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-09
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-10
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2024-11
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2023-12
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2023-13
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2023-14
Could not compute solution for formula : CANConstruction-PT-030-CTLFireability-2023-15

BK_STOP 1717178472037

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name CANConstruction-PT-030-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1501/ctl_0_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1501/ctl_1_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1501/ctl_2_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1501/ctl_3_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1501/ctl_4_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1501/ctl_5_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1501/ctl_6_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1501/ctl_7_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1501/ctl_8_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1501/ctl_9_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1501/ctl_10_
ctl formula name CANConstruction-PT-030-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1501/ctl_11_
ctl formula name CANConstruction-PT-030-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1501/ctl_12_
ctl formula name CANConstruction-PT-030-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1501/ctl_13_
ctl formula name CANConstruction-PT-030-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1501/ctl_14_
ctl formula name CANConstruction-PT-030-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1501/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-030, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000026"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;