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.r579-smll-171734921200065.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 MedleyA-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 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 MedleyA-PT-09-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354436182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:53:59] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-06-02 18:53:59] [INFO ] Transformed 147 places.
[2024-06-02 18:53:59] [INFO ] Transformed 315 transitions.
[2024-06-02 18:53:59] [INFO ] Found NUPN structural information;
[2024-06-02 18:53:59] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 126 transition count 295
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 126 transition count 295
Applied a total of 36 rules in 70 ms. Remains 126 /145 variables (removed 19) and now considering 295/313 (removed 18) transitions.
// Phase 1: matrix 295 rows 126 cols
[2024-06-02 18:53:59] [INFO ] Computed 10 invariants in 32 ms
[2024-06-02 18:54:00] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-02 18:54:00] [INFO ] Invariant cache hit.
[2024-06-02 18:54:00] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 18:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/126 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:05] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 29 ms to minimize.
[2024-06-02 18:54:05] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-02 18:54:05] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-06-02 18:54:07] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 4/27 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/27 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 295/421 variables, 126/153 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:54:17] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:54:17] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 10/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/421 variables, 0/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 163 constraints, problems are : Problem set: 64 solved, 230 unsolved in 23403 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 64 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 27/37 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:27] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/38 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 295/421 variables, 126/164 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 230/394 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:35] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 2 ms to minimize.
[2024-06-02 18:54:36] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 2 ms to minimize.
[2024-06-02 18:54:36] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 3/397 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:42] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:54:43] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-06-02 18:54:43] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 11 ms to minimize.
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 6/403 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 18:54:53] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 404 constraints, problems are : Problem set: 64 solved, 230 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 230/294 constraints, Known Traps: 38/38 constraints]
After SMT, in 54648ms problems are : Problem set: 64 solved, 230 unsolved
Search for dead transitions found 64 dead transitions in 54689ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 126/145 places, 231/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55689 ms. Remains : 126/145 places, 231/313 transitions.
Support contains 67 out of 126 places after structural reductions.
[2024-06-02 18:54:55] [INFO ] Flatten gal took : 133 ms
[2024-06-02 18:54:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:54:55] [INFO ] Flatten gal took : 51 ms
[2024-06-02 18:54:55] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 66 out of 126 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (1329 resets) in 2848 ms. (14 steps per ms) remains 15/41 properties
BEST_FIRST walk for 4004 steps (29 resets) in 90 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 82 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
// Phase 1: matrix 231 rows 126 cols
[2024-06-02 18:54:57] [INFO ] Computed 10 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/73 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/107 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 218/325 variables, 107/116 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 23/348 variables, 14/130 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 9/357 variables, 5/136 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/357 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 136 constraints, problems are : Problem set: 1 solved, 14 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/107 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:54:58] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:54:59] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 218/325 variables, 107/124 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 11/135 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:54:59] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:54:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:54:59] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:54:59] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/139 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 2/144 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:55:01] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-06-02 18:55:01] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 18 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 23/348 variables, 14/160 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 3/164 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 9/357 variables, 5/169 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-02 18:55:02] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/357 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 170 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 20/20 constraints]
After SMT, in 5668ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 124 transition count 216
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 112 transition count 212
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 109 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 34 place count 109 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 107 transition count 209
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 47 place count 98 transition count 197
Iterating global reduction 3 with 9 rules applied. Total rules applied 56 place count 98 transition count 197
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 3 with 1 rules applied. Total rules applied 57 place count 98 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 97 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 58 place count 97 transition count 195
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 96 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 95 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 95 transition count 193
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 37 rules applied. Total rules applied 99 place count 76 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 101 place count 76 transition count 172
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 111 place count 71 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 124 place count 71 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 70 transition count 186
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 130 place count 70 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 134 place count 66 transition count 182
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 135 place count 66 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 136 place count 65 transition count 181
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 140 place count 65 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 141 place count 64 transition count 180
Applied a total of 141 rules in 221 ms. Remains 64 /126 variables (removed 62) and now considering 180/231 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 64/126 places, 180/231 transitions.
RANDOM walk for 40000 steps (3065 resets) in 1368 ms. (29 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (702 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (686 resets) in 150 ms. (264 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (701 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2024-06-02 18:55:03] [INFO ] Flow matrix only has 176 transitions (discarded 4 similar events)
// Phase 1: matrix 176 rows 64 cols
[2024-06-02 18:55:03] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:55:03] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/215 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/235 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/238 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/240 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/240 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/215 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/235 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/238 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/240 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/240 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 783 steps, including 43 resets, run visited all 2 properties in 24 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 34 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:55:04] [INFO ] Input system was already deterministic with 231 transitions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 123 transition count 216
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 15 rules applied. Total rules applied 28 place count 111 transition count 213
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 110 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 39 place count 106 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 39 place count 106 transition count 204
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 45 place count 103 transition count 204
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 56 place count 92 transition count 188
Iterating global reduction 4 with 11 rules applied. Total rules applied 67 place count 92 transition count 188
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 4 with 1 rules applied. Total rules applied 68 place count 92 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 91 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 70 place count 90 transition count 185
Iterating global reduction 6 with 1 rules applied. Total rules applied 71 place count 90 transition count 185
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 100 place count 75 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 106 place count 75 transition count 165
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 108 place count 75 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 110 place count 73 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 110 place count 73 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 114 place count 71 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 118 place count 69 transition count 159
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 120 place count 69 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 122 place count 67 transition count 157
Applied a total of 122 rules in 113 ms. Remains 67 /126 variables (removed 59) and now considering 157/231 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 67/126 places, 157/231 transitions.
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:55:04] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 110 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 110 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 109 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 109 transition count 210
Applied a total of 34 rules in 16 ms. Remains 109 /126 variables (removed 17) and now considering 210/231 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 109/126 places, 210/231 transitions.
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:55:04] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 210
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 105 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 103 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 45 place count 103 transition count 198
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 57 place count 97 transition count 198
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 71 place count 83 transition count 181
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 83 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 85 place count 83 transition count 179
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 81 transition count 179
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 121 place count 64 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 62 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 62 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 62 transition count 154
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 3 with 1 rules applied. Total rules applied 132 place count 62 transition count 153
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 61 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 60 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 135 place count 60 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 137 place count 59 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 58 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 56 transition count 148
Applied a total of 141 rules in 83 ms. Remains 56 /126 variables (removed 70) and now considering 148/231 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 56/126 places, 148/231 transitions.
[2024-06-02 18:55:04] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 208
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 206
Applied a total of 42 rules in 11 ms. Remains 105 /126 variables (removed 21) and now considering 206/231 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 105/126 places, 206/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 108 transition count 209
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 108 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 107 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 107 transition count 207
Applied a total of 38 rules in 8 ms. Remains 107 /126 variables (removed 19) and now considering 207/231 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 107/126 places, 207/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 123 transition count 207
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 102 transition count 203
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 100 transition count 201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51 place count 100 transition count 196
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 95 transition count 196
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 76 place count 80 transition count 177
Iterating global reduction 3 with 15 rules applied. Total rules applied 91 place count 80 transition count 177
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 3 with 1 rules applied. Total rules applied 92 place count 80 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 79 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 93 place count 79 transition count 174
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 97 place count 77 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 76 transition count 172
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 76 transition count 172
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 131 place count 59 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 58 transition count 155
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 58 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 58 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 141 place count 58 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 143 place count 56 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 143 place count 56 transition count 145
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 147 place count 54 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 151 place count 52 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 153 place count 50 transition count 141
Applied a total of 153 rules in 66 ms. Remains 50 /126 variables (removed 76) and now considering 141/231 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 50/126 places, 141/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 205
Applied a total of 42 rules in 7 ms. Remains 105 /126 variables (removed 21) and now considering 205/231 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 105/126 places, 205/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 106 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 106 transition count 207
Applied a total of 40 rules in 8 ms. Remains 106 /126 variables (removed 20) and now considering 207/231 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 106/126 places, 207/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 216
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 112 transition count 216
Applied a total of 28 rules in 5 ms. Remains 112 /126 variables (removed 14) and now considering 216/231 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 112/126 places, 216/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 105 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 104 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 104 transition count 204
Applied a total of 44 rules in 7 ms. Remains 104 /126 variables (removed 22) and now considering 204/231 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 104/126 places, 204/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 123 transition count 208
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 103 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 101 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 100 transition count 201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 51 place count 100 transition count 196
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 61 place count 95 transition count 196
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 77 place count 79 transition count 175
Iterating global reduction 4 with 16 rules applied. Total rules applied 93 place count 79 transition count 175
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 4 with 1 rules applied. Total rules applied 94 place count 79 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 172
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 99 place count 76 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 100 place count 75 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 75 transition count 170
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 133 place count 58 transition count 155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 57 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 57 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 141 place count 57 transition count 147
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 143 place count 57 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 145 place count 55 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 145 place count 55 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 149 place count 53 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 153 place count 51 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 155 place count 49 transition count 139
Applied a total of 155 rules in 57 ms. Remains 49 /126 variables (removed 77) and now considering 139/231 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 49/126 places, 139/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 205
Applied a total of 42 rules in 7 ms. Remains 105 /126 variables (removed 21) and now considering 205/231 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 105/126 places, 205/231 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:55:05] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:55:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:05] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-02 18:55:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 231 transitions and 1029 arcs took 5 ms.
Total runtime 67136 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 : MedleyA-PT-09-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-10
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-09-CTLCardinality-2024-15

BK_STOP 1717354506638

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-09-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/713/ctl_0_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/713/ctl_1_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/713/ctl_2_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/713/ctl_3_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/713/ctl_4_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/713/ctl_5_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/713/ctl_6_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/713/ctl_7_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/713/ctl_8_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/713/ctl_9_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/713/ctl_10_
ctl formula name MedleyA-PT-09-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/713/ctl_11_
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="MedleyA-PT-09"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921200065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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