MCC'2024- Execution of r528-tall-171683761200490

About the Execution of LTSMin+red for ShieldPPPs-PT-040B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2571.344	192363.00	276080.00	486.80	[undef]	Cannot compute

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.r528-tall-171683761200490.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 ShieldPPPs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761200490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 708K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717249265156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:41:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:41:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:41:06] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-06-01 13:41:06] [INFO ] Transformed 2723 places.
[2024-06-01 13:41:06] [INFO ] Transformed 2523 transitions.
[2024-06-01 13:41:06] [INFO ] Found NUPN structural information;
[2024-06-01 13:41:06] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 150 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 253 places :
Symmetric choice reduction at 0 with 253 rule applications. Total rules 253 place count 2470 transition count 2270
Iterating global reduction 0 with 253 rules applied. Total rules applied 506 place count 2470 transition count 2270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 507 place count 2469 transition count 2269
Iterating global reduction 0 with 1 rules applied. Total rules applied 508 place count 2469 transition count 2269
Applied a total of 508 rules in 795 ms. Remains 2469 /2723 variables (removed 254) and now considering 2269/2523 (removed 254) transitions.
// Phase 1: matrix 2269 rows 2469 cols
[2024-06-01 13:41:07] [INFO ] Computed 441 invariants in 48 ms
[2024-06-01 13:41:08] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-06-01 13:41:08] [INFO ] Invariant cache hit.
[2024-06-01 13:41:11] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
Running 2268 sub problems to find dead transitions.
[2024-06-01 13:41:11] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2468/4738 variables, and 0 constraints, problems are : Problem set: 0 solved, 2268 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2469 constraints, PredecessorRefiner: 2268/2268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2268 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2468/4738 variables, and 0 constraints, problems are : Problem set: 0 solved, 2268 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2469 constraints, PredecessorRefiner: 0/2268 constraints, Known Traps: 0/0 constraints]
After SMT, in 60850ms problems are : Problem set: 0 solved, 2268 unsolved
Search for dead transitions found 0 dead transitions in 60891ms
Starting structural reductions in LTL mode, iteration 1 : 2469/2723 places, 2269/2523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65097 ms. Remains : 2469/2723 places, 2269/2523 transitions.
Support contains 150 out of 2469 places after structural reductions.
[2024-06-01 13:42:12] [INFO ] Flatten gal took : 198 ms
[2024-06-01 13:42:12] [INFO ] Flatten gal took : 100 ms
[2024-06-01 13:42:12] [INFO ] Input system was already deterministic with 2269 transitions.
RANDOM walk for 40000 steps (8 resets) in 2575 ms. (15 steps per ms) remains 23/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
[2024-06-01 13:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 489/532 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1937/2469 variables, 376/441 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 40 ms to minimize.
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 15 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 19 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 4 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 4 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 7 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2469/4738 variables, and 453 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/2469 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 489/532 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1937/2469 variables, 376/441 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2469 variables, 12/453 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 4 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 4 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 3 ms to minimize.
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 3 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2469 variables, 13/466 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2469/4738 variables, and 466 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/2469 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 25/25 constraints]
After SMT, in 10060ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 2469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 2469 transition count 1997
Reduce places removed 272 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 276 rules applied. Total rules applied 548 place count 2197 transition count 1993
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 552 place count 2193 transition count 1993
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 552 place count 2193 transition count 1797
Deduced a syphon composed of 196 places in 13 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 944 place count 1997 transition count 1797
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 964 place count 1977 transition count 1777
Iterating global reduction 3 with 20 rules applied. Total rules applied 984 place count 1977 transition count 1777
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 984 place count 1977 transition count 1769
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1000 place count 1969 transition count 1769
Performed 697 Post agglomeration using F-continuation condition.Transition count delta: 697
Deduced a syphon composed of 697 places in 3 ms
Reduce places removed 697 places and 0 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 2394 place count 1272 transition count 1072
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 344 times.
Drop transitions (Partial Free agglomeration) removed 344 transitions
Iterating global reduction 3 with 344 rules applied. Total rules applied 2738 place count 1272 transition count 1072
Applied a total of 2738 rules in 942 ms. Remains 1272 /2469 variables (removed 1197) and now considering 1072/2269 (removed 1197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 1272/2469 places, 1072/2269 transitions.
RANDOM walk for 40000 steps (8 resets) in 2372 ms. (16 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
// Phase 1: matrix 1072 rows 1272 cols
[2024-06-01 13:42:25] [INFO ] Computed 441 invariants in 53 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/105 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1234 variables, 391/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 3 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1234 variables, 17/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/1272 variables, 19/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1072/2344 variables, 1272/1733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:42:28] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 5 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 5 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 5 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 5 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2344 variables, 5/1738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2344 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2344 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2344/2344 variables, and 1738 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4480 ms.
Refiners :[Positive P Invariants (semi-flows): 422/422 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1272/1272 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/105 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1234 variables, 391/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1234 variables, 23/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/1272 variables, 19/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1272 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1072/2344 variables, 1272/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2344 variables, 2/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2344 variables, 12/1757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2344 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2344 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2344/2344 variables, and 1757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 422/422 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1272/1272 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 42/42 constraints]
After SMT, in 8309ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6221 ms.
Support contains 11 out of 1272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1272/1272 places, 1072/1072 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 1272 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1271 transition count 1071
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1271 transition count 1069
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1269 transition count 1069
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 38 place count 1253 transition count 1053
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 1253 transition count 1053
Applied a total of 45 rules in 143 ms. Remains 1253 /1272 variables (removed 19) and now considering 1053/1072 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1253/1272 places, 1053/1072 transitions.
RANDOM walk for 40000 steps (8 resets) in 535 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175035 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :1 out of 2
Probabilistic random walk after 175035 steps, saw 161932 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :1
// Phase 1: matrix 1053 rows 1253 cols
[2024-06-01 13:42:43] [INFO ] Computed 441 invariants in 46 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/83 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1211 variables, 394/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 11/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/1253 variables, 21/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1053/2306 variables, 1253/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2306 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2306 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 1707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 420/420 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/83 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1211 variables, 394/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 11/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 13/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1211 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/1253 variables, 21/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1253 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1053/2306 variables, 1253/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2306 variables, 1/1724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2306 variables, 5/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2306 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2306 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1729 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5132 ms.
Refiners :[Positive P Invariants (semi-flows): 420/420 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 constraints]
After SMT, in 6731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1649 ms.
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1053/1053 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1249 transition count 1049
Applied a total of 8 rules in 109 ms. Remains 1249 /1253 variables (removed 4) and now considering 1049/1053 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1249/1253 places, 1049/1053 transitions.
RANDOM walk for 40000 steps (8 resets) in 632 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197707 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197707 steps, saw 178033 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 1049 rows 1249 cols
[2024-06-01 13:42:55] [INFO ] Computed 441 invariants in 16 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1104/1185 variables, 384/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1185 variables, 13/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1185 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/1249 variables, 32/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1249 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1249 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1049/2298 variables, 1249/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 5 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 5 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2298 variables, 12/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2298 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2298 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2298/2298 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4520 ms.
Refiners :[Positive P Invariants (semi-flows): 409/409 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1104/1185 variables, 384/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1185 variables, 21/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1185 variables, 13/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1185 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/1249 variables, 32/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1249 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1249 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1049/2298 variables, 1249/1732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2298 variables, 1/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:43:04] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:43:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2298 variables, 2/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2298 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2298 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2298/2298 variables, and 1735 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4284 ms.
Refiners :[Positive P Invariants (semi-flows): 409/409 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 44/44 constraints]
After SMT, in 8836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1564 ms.
Support contains 6 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1049/1049 transitions.
Applied a total of 0 rules in 43 ms. Remains 1249 /1249 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1249/1249 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1049/1049 transitions.
Applied a total of 0 rules in 43 ms. Remains 1249 /1249 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-06-01 13:43:06] [INFO ] Invariant cache hit.
[2024-06-01 13:43:06] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-06-01 13:43:06] [INFO ] Invariant cache hit.
[2024-06-01 13:43:08] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-06-01 13:43:08] [INFO ] Redundant transitions in 59 ms returned []
Running 1048 sub problems to find dead transitions.
[2024-06-01 13:43:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1248 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1248/2298 variables, and 32 constraints, problems are : Problem set: 0 solved, 1048 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/409 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1048/1048 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1048 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1248 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1248 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 2 (OVERLAPS) 1/1249 variables, 409/441 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 4 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 4 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 4 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:44:00] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1249 variables, 20/501 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:44:07] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
SMT process timed out in 60369ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62628 ms. Remains : 1249/1249 places, 1049/1049 transitions.
[2024-06-01 13:44:08] [INFO ] Flatten gal took : 73 ms
[2024-06-01 13:44:08] [INFO ] Flatten gal took : 78 ms
[2024-06-01 13:44:08] [INFO ] Input system was already deterministic with 2269 transitions.
Computed a total of 493 stabilizing places and 493 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2442 transition count 2242
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2442 transition count 2242
Applied a total of 54 rules in 334 ms. Remains 2442 /2469 variables (removed 27) and now considering 2242/2269 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 2442/2469 places, 2242/2269 transitions.
[2024-06-01 13:44:09] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:44:09] [INFO ] Flatten gal took : 57 ms
[2024-06-01 13:44:09] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2468 transition count 1988
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2188 transition count 1988
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 560 place count 2188 transition count 1789
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 958 place count 1989 transition count 1789
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 984 place count 1963 transition count 1763
Iterating global reduction 2 with 26 rules applied. Total rules applied 1010 place count 1963 transition count 1763
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1010 place count 1963 transition count 1755
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1026 place count 1955 transition count 1755
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 1 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2442 place count 1247 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2444 place count 1245 transition count 1045
Applied a total of 2444 rules in 424 ms. Remains 1245 /2469 variables (removed 1224) and now considering 1045/2269 (removed 1224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 424 ms. Remains : 1245/2469 places, 1045/2269 transitions.
[2024-06-01 13:44:10] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:44:10] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:44:10] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2446 transition count 2246
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2446 transition count 2246
Applied a total of 46 rules in 265 ms. Remains 2446 /2469 variables (removed 23) and now considering 2246/2269 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 2446/2469 places, 2246/2269 transitions.
[2024-06-01 13:44:10] [INFO ] Flatten gal took : 48 ms
[2024-06-01 13:44:10] [INFO ] Flatten gal took : 49 ms
[2024-06-01 13:44:10] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2442 transition count 2242
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2442 transition count 2242
Applied a total of 54 rules in 287 ms. Remains 2442 /2469 variables (removed 27) and now considering 2242/2269 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 2442/2469 places, 2242/2269 transitions.
[2024-06-01 13:44:10] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:44:11] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:44:11] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2468 transition count 1988
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 2188 transition count 1987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 2187 transition count 1987
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 562 place count 2187 transition count 1788
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 960 place count 1988 transition count 1788
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 987 place count 1961 transition count 1761
Iterating global reduction 3 with 27 rules applied. Total rules applied 1014 place count 1961 transition count 1761
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1014 place count 1961 transition count 1753
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1030 place count 1953 transition count 1753
Performed 709 Post agglomeration using F-continuation condition.Transition count delta: 709
Deduced a syphon composed of 709 places in 1 ms
Reduce places removed 709 places and 0 transitions.
Iterating global reduction 3 with 1418 rules applied. Total rules applied 2448 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2450 place count 1242 transition count 1042
Applied a total of 2450 rules in 400 ms. Remains 1242 /2469 variables (removed 1227) and now considering 1042/2269 (removed 1227) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 400 ms. Remains : 1242/2469 places, 1042/2269 transitions.
[2024-06-01 13:44:11] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:44:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:44:11] [INFO ] Input system was already deterministic with 1042 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2444 transition count 2244
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2444 transition count 2244
Applied a total of 50 rules in 265 ms. Remains 2444 /2469 variables (removed 25) and now considering 2244/2269 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 2444/2469 places, 2244/2269 transitions.
[2024-06-01 13:44:11] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:44:12] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:44:12] [INFO ] Input system was already deterministic with 2244 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2468 transition count 1988
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2188 transition count 1988
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 560 place count 2188 transition count 1790
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 956 place count 1990 transition count 1790
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 982 place count 1964 transition count 1764
Iterating global reduction 2 with 26 rules applied. Total rules applied 1008 place count 1964 transition count 1764
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1008 place count 1964 transition count 1756
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1024 place count 1956 transition count 1756
Performed 706 Post agglomeration using F-continuation condition.Transition count delta: 706
Deduced a syphon composed of 706 places in 1 ms
Reduce places removed 706 places and 0 transitions.
Iterating global reduction 2 with 1412 rules applied. Total rules applied 2436 place count 1250 transition count 1050
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2438 place count 1248 transition count 1048
Applied a total of 2438 rules in 392 ms. Remains 1248 /2469 variables (removed 1221) and now considering 1048/2269 (removed 1221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 393 ms. Remains : 1248/2469 places, 1048/2269 transitions.
[2024-06-01 13:44:12] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:44:12] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:44:12] [INFO ] Input system was already deterministic with 1048 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2443 transition count 2243
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2443 transition count 2243
Applied a total of 52 rules in 261 ms. Remains 2443 /2469 variables (removed 26) and now considering 2243/2269 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 2443/2469 places, 2243/2269 transitions.
[2024-06-01 13:44:12] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:44:12] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:44:13] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 2468 transition count 1991
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 2191 transition count 1990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 2190 transition count 1990
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 556 place count 2190 transition count 1792
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 952 place count 1992 transition count 1792
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 974 place count 1970 transition count 1770
Iterating global reduction 3 with 22 rules applied. Total rules applied 996 place count 1970 transition count 1770
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 996 place count 1970 transition count 1763
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1010 place count 1963 transition count 1763
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 701
Deduced a syphon composed of 701 places in 2 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 3 with 1402 rules applied. Total rules applied 2412 place count 1262 transition count 1062
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2414 place count 1260 transition count 1060
Applied a total of 2414 rules in 447 ms. Remains 1260 /2469 variables (removed 1209) and now considering 1060/2269 (removed 1209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 447 ms. Remains : 1260/2469 places, 1060/2269 transitions.
[2024-06-01 13:44:13] [INFO ] Flatten gal took : 25 ms
[2024-06-01 13:44:13] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:44:13] [INFO ] Input system was already deterministic with 1060 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 2445 transition count 2245
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 2445 transition count 2245
Applied a total of 48 rules in 278 ms. Remains 2445 /2469 variables (removed 24) and now considering 2245/2269 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 2445/2469 places, 2245/2269 transitions.
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:44:14] [INFO ] Input system was already deterministic with 2245 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 2469 transition count 1995
Reduce places removed 274 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 2195 transition count 1993
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 2193 transition count 1993
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 552 place count 2193 transition count 1796
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 946 place count 1996 transition count 1796
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 965 place count 1977 transition count 1777
Iterating global reduction 3 with 19 rules applied. Total rules applied 984 place count 1977 transition count 1777
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 984 place count 1977 transition count 1772
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 994 place count 1972 transition count 1772
Performed 703 Post agglomeration using F-continuation condition.Transition count delta: 703
Deduced a syphon composed of 703 places in 1 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 3 with 1406 rules applied. Total rules applied 2400 place count 1269 transition count 1069
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2400 rules in 349 ms. Remains 1269 /2469 variables (removed 1200) and now considering 1069/2269 (removed 1200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 349 ms. Remains : 1269/2469 places, 1069/2269 transitions.
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:44:14] [INFO ] Input system was already deterministic with 1069 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2443 transition count 2243
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2443 transition count 2243
Applied a total of 52 rules in 261 ms. Remains 2443 /2469 variables (removed 26) and now considering 2243/2269 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 2443/2469 places, 2243/2269 transitions.
[2024-06-01 13:44:14] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:44:15] [INFO ] Flatten gal took : 48 ms
[2024-06-01 13:44:15] [INFO ] Input system was already deterministic with 2243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2446 transition count 2246
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2446 transition count 2246
Applied a total of 46 rules in 284 ms. Remains 2446 /2469 variables (removed 23) and now considering 2246/2269 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 2446/2469 places, 2246/2269 transitions.
[2024-06-01 13:44:15] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:44:15] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:44:15] [INFO ] Input system was already deterministic with 2246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2442 transition count 2242
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2442 transition count 2242
Applied a total of 54 rules in 268 ms. Remains 2442 /2469 variables (removed 27) and now considering 2242/2269 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 2442/2469 places, 2242/2269 transitions.
[2024-06-01 13:44:15] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:44:15] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:44:16] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2442 transition count 2242
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2442 transition count 2242
Applied a total of 54 rules in 292 ms. Remains 2442 /2469 variables (removed 27) and now considering 2242/2269 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 2442/2469 places, 2242/2269 transitions.
[2024-06-01 13:44:16] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:44:16] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:44:16] [INFO ] Input system was already deterministic with 2242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2469/2469 places, 2269/2269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2468 transition count 1990
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 2190 transition count 1989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 2189 transition count 1989
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 558 place count 2189 transition count 1789
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 958 place count 1989 transition count 1789
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 983 place count 1964 transition count 1764
Iterating global reduction 3 with 25 rules applied. Total rules applied 1008 place count 1964 transition count 1764
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1008 place count 1964 transition count 1757
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1022 place count 1957 transition count 1757
Performed 702 Post agglomeration using F-continuation condition.Transition count delta: 702
Deduced a syphon composed of 702 places in 1 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 2426 place count 1255 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2428 place count 1253 transition count 1053
Applied a total of 2428 rules in 344 ms. Remains 1253 /2469 variables (removed 1216) and now considering 1053/2269 (removed 1216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 344 ms. Remains : 1253/2469 places, 1053/2269 transitions.
[2024-06-01 13:44:16] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:44:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:44:16] [INFO ] Input system was already deterministic with 1053 transitions.
[2024-06-01 13:44:17] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:44:17] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:44:17] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 13:44:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2469 places, 2269 transitions and 6458 arcs took 16 ms.
Total runtime 190838 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 : ShieldPPPs-PT-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPs-PT-040B-CTLFireability-2023-15

BK_STOP 1717249457519

--------------------
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 ShieldPPPs-PT-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1255/ctl_0_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1255/ctl_1_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1255/ctl_2_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1255/ctl_3_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1255/ctl_4_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1255/ctl_5_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1255/ctl_6_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1255/ctl_7_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1255/ctl_8_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1255/ctl_9_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1255/ctl_10_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1255/ctl_11_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1255/ctl_12_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1255/ctl_13_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1255/ctl_14_
ctl formula name ShieldPPPs-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1255/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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, 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 r528-tall-171683761200490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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