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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717353999542

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:46:41] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-06-02 18:46:41] [INFO ] Transformed 147 places.
[2024-06-02 18:46:41] [INFO ] Transformed 312 transitions.
[2024-06-02 18:46:41] [INFO ] Found NUPN structural information;
[2024-06-02 18:46:41] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Support contains 84 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 135 transition count 298
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 135 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 134 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 134 transition count 297
Applied a total of 26 rules in 48 ms. Remains 134 /147 variables (removed 13) and now considering 297/312 (removed 15) transitions.
// Phase 1: matrix 297 rows 134 cols
[2024-06-02 18:46:41] [INFO ] Computed 11 invariants in 29 ms
[2024-06-02 18:46:42] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-02 18:46:42] [INFO ] Invariant cache hit.
[2024-06-02 18:46:42] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 18:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/134 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:46:46] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 23 ms to minimize.
[2024-06-02 18:46:46] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-06-02 18:46:46] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:46:46] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:46:46] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 4 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 15 ms to minimize.
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 13/24 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:46:49] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:46:49] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:46:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:46:50] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 4/28 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:46:51] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/29 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 297/431 variables, 134/163 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:46:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 1/164 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/164 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/431 variables, 1/165 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:03] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/431 variables, 1/166 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:06] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:47:06] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:47:06] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:47:06] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-02 18:47:07] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:47:07] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 6/172 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/172 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 15 (OVERLAPS) 0/431 variables, 0/172 constraints. Problems are: Problem set: 48 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 172 constraints, problems are : Problem set: 48 solved, 248 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 48 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 3/134 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 27/38 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/38 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 297/431 variables, 134/172 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 248/420 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:19] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:47:20] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:47:20] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:47:20] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:47:20] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:47:21] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:47:22] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:47:23] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 8/428 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:28] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:47:28] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:47:28] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:47:29] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:47:29] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:47:29] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/434 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 18:47:34] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:47:35] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 6/440 constraints. Problems are: Problem set: 48 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 440 constraints, problems are : Problem set: 48 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 248/296 constraints, Known Traps: 47/47 constraints]
After SMT, in 60764ms problems are : Problem set: 48 solved, 248 unsolved
Search for dead transitions found 48 dead transitions in 60835ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 134/147 places, 249/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61611 ms. Remains : 134/147 places, 249/312 transitions.
Support contains 84 out of 134 places after structural reductions.
[2024-06-02 18:47:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:47:43] [INFO ] Flatten gal took : 68 ms
FORMULA MedleyA-PT-08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:47:43] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:47:43] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 79 out of 134 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (1976 resets) in 1946 ms. (20 steps per ms) remains 20/58 properties
BEST_FIRST walk for 4003 steps (53 resets) in 101 ms. (39 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (62 resets) in 120 ms. (33 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 92 ms. (43 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (55 resets) in 98 ms. (40 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 102 ms. (38 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 57 ms. (69 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (48 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (56 resets) in 54 ms. (72 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (51 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (49 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (47 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (50 resets) in 24 ms. (160 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (50 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
// Phase 1: matrix 249 rows 134 cols
[2024-06-02 18:47:44] [INFO ] Computed 11 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 66/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 33/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 249/383 variables, 134/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 145 constraints, problems are : Problem set: 0 solved, 19 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 66/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:45] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 33/134 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:45] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 12 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:47:46] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:47:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:48] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 249/383 variables, 134/173 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 19/192 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:47:50] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:47:50] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 195 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 31/31 constraints]
After SMT, in 5662ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 127 transition count 230
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 120 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 118 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 29 place count 118 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 115 transition count 224
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 45 place count 105 transition count 210
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 105 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 104 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 104 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 103 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 103 transition count 202
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 60 place count 103 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 102 transition count 200
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 82 place count 92 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 84 place count 92 transition count 188
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 86 place count 90 transition count 186
Iterating global reduction 6 with 2 rules applied. Total rules applied 88 place count 90 transition count 186
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 94 place count 87 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 104 place count 87 transition count 190
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 109 place count 87 transition count 185
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 114 place count 82 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 82 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 81 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 81 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 118 place count 80 transition count 186
Applied a total of 118 rules in 127 ms. Remains 80 /134 variables (removed 54) and now considering 186/249 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 80/134 places, 186/249 transitions.
RANDOM walk for 40000 steps (2413 resets) in 530 ms. (75 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40004 steps (591 resets) in 176 ms. (226 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (584 resets) in 73 ms. (540 steps per ms) remains 1/4 properties
// Phase 1: matrix 186 rows 80 cols
[2024-06-02 18:47:51] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:47:51] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/40 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/158 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 77/235 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/247 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/254 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/266 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/266 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/266 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 80/80 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/40 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/158 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 77/235 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/247 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/254 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/266 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/266 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/266 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/266 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 80/80 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 9 ms.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 105 transition count 217
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 105 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 105 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 99 transition count 198
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 99 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 97 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 97 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 96 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 96 transition count 190
Applied a total of 77 rules in 19 ms. Remains 96 /134 variables (removed 38) and now considering 190/249 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 96/134 places, 190/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 190 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 106 transition count 217
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 106 transition count 217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 106 transition count 213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 100 transition count 193
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 100 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 96 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 96 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 94 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 94 transition count 177
Applied a total of 82 rules in 17 ms. Remains 94 /134 variables (removed 40) and now considering 177/249 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 94/134 places, 177/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 126 transition count 229
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 110 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 109 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 109 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 107 transition count 225
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 62 place count 85 transition count 196
Iterating global reduction 3 with 22 rules applied. Total rules applied 84 place count 85 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 85 transition count 195
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 84 transition count 195
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 93 place count 77 transition count 174
Iterating global reduction 3 with 7 rules applied. Total rules applied 100 place count 77 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 73 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 73 transition count 162
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 3 with 2 rules applied. Total rules applied 110 place count 73 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 114 place count 71 transition count 158
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 69 transition count 152
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 69 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 140 place count 57 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 55 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 55 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 149 place count 55 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 149 place count 55 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 155 place count 52 transition count 132
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 5 with 4 rules applied. Total rules applied 159 place count 50 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 49 transition count 129
Applied a total of 160 rules in 67 ms. Remains 49 /134 variables (removed 85) and now considering 129/249 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 49/134 places, 129/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 249
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 102 transition count 211
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 102 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 102 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 96 transition count 187
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 96 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 92 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 92 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 91 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 91 transition count 174
Applied a total of 89 rules in 11 ms. Remains 91 /134 variables (removed 43) and now considering 174/249 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 91/134 places, 174/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 101 transition count 211
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 101 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 101 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 94 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 94 transition count 186
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 90 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 90 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 88 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 88 transition count 170
Applied a total of 94 rules in 12 ms. Remains 88 /134 variables (removed 46) and now considering 170/249 (removed 79) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 88/134 places, 170/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 126 transition count 227
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 108 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 107 transition count 224
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 62 place count 86 transition count 196
Iterating global reduction 2 with 21 rules applied. Total rules applied 83 place count 86 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 83 place count 86 transition count 194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 84 transition count 194
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 93 place count 78 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 78 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 74 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 74 transition count 162
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 2 with 2 rules applied. Total rules applied 109 place count 74 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 72 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 70 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 70 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 137 place count 60 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 58 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 58 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 146 place count 58 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 146 place count 58 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 55 transition count 132
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 4 with 4 rules applied. Total rules applied 156 place count 53 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 52 transition count 129
Applied a total of 157 rules in 52 ms. Remains 52 /134 variables (removed 82) and now considering 129/249 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 52/134 places, 129/249 transitions.
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:47:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 104 transition count 214
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 104 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 104 transition count 210
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 97 transition count 189
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 97 transition count 189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 93 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 93 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 91 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 91 transition count 173
Applied a total of 88 rules in 9 ms. Remains 91 /134 variables (removed 43) and now considering 173/249 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 91/134 places, 173/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 109 transition count 222
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 109 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 109 transition count 219
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 105 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 105 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 104 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 104 transition count 209
Applied a total of 61 rules in 8 ms. Remains 104 /134 variables (removed 30) and now considering 209/249 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 104/134 places, 209/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 129 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 128 transition count 231
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 113 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 111 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 37 place count 111 transition count 226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 110 transition count 226
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 60 place count 89 transition count 199
Iterating global reduction 3 with 21 rules applied. Total rules applied 81 place count 89 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 89 transition count 198
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 88 transition count 198
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 82 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 82 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 79 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 79 transition count 173
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 102 place count 79 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 78 transition count 171
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 106 place count 76 transition count 165
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 76 transition count 165
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 134 place count 62 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 136 place count 62 transition count 151
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 138 place count 60 transition count 149
Iterating global reduction 6 with 2 rules applied. Total rules applied 140 place count 60 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 145 place count 60 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 145 place count 60 transition count 141
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 151 place count 57 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 155 place count 55 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 54 transition count 138
Applied a total of 156 rules in 54 ms. Remains 54 /134 variables (removed 80) and now considering 138/249 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 54/134 places, 138/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 106 transition count 217
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 106 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 106 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 100 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 100 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 97 transition count 190
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 97 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 96 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 96 transition count 187
Applied a total of 77 rules in 9 ms. Remains 96 /134 variables (removed 38) and now considering 187/249 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 96/134 places, 187/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 126 transition count 227
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 108 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 107 transition count 224
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 64 place count 84 transition count 194
Iterating global reduction 2 with 23 rules applied. Total rules applied 87 place count 84 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 84 transition count 192
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 91 place count 82 transition count 192
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 75 transition count 171
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 75 transition count 171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 71 transition count 159
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 71 transition count 159
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 2 with 2 rules applied. Total rules applied 115 place count 71 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 69 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 67 transition count 149
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 67 transition count 149
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 145 place count 55 transition count 139
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 53 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 53 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 154 place count 53 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 154 place count 53 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 51 transition count 130
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 4 with 4 rules applied. Total rules applied 162 place count 49 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 48 transition count 127
Applied a total of 163 rules in 37 ms. Remains 48 /134 variables (removed 86) and now considering 127/249 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 48/134 places, 127/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 126 transition count 228
Reduce places removed 17 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 1 with 20 rules applied. Total rules applied 38 place count 109 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 108 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 106 transition count 223
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 64 place count 85 transition count 195
Iterating global reduction 3 with 21 rules applied. Total rules applied 85 place count 85 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 85 transition count 194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 84 transition count 194
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 77 transition count 173
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 77 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 75 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 75 transition count 167
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 106 place count 75 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 74 transition count 165
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 109 place count 73 transition count 162
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 73 transition count 162
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 134 place count 60 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 60 transition count 150
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 137 place count 58 transition count 148
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 58 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 143 place count 58 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 143 place count 58 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 149 place count 55 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 54 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 53 transition count 139
Applied a total of 152 rules in 39 ms. Remains 53 /134 variables (removed 81) and now considering 139/249 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 53/134 places, 139/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 129 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 128 transition count 229
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 111 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 110 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 110 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 108 transition count 225
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 63 place count 87 transition count 197
Iterating global reduction 3 with 21 rules applied. Total rules applied 84 place count 87 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 87 transition count 195
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 85 transition count 195
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 79 transition count 175
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 79 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 76 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 76 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 3 with 2 rules applied. Total rules applied 108 place count 76 transition count 163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 74 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 113 place count 73 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 73 transition count 158
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 133 place count 63 transition count 149
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 61 transition count 147
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 61 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 142 place count 61 transition count 142
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 142 place count 61 transition count 139
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 148 place count 58 transition count 139
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 5 with 4 rules applied. Total rules applied 152 place count 56 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 55 transition count 136
Applied a total of 153 rules in 37 ms. Remains 55 /134 variables (removed 79) and now considering 136/249 (removed 113) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 55/134 places, 136/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 105 transition count 215
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 105 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 105 transition count 213
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 98 transition count 192
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 98 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 96 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 96 transition count 188
Applied a total of 76 rules in 7 ms. Remains 96 /134 variables (removed 38) and now considering 188/249 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 96/134 places, 188/249 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2024-06-02 18:47:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 249 transitions and 994 arcs took 3 ms.
Total runtime 71533 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-08-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-07
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-10
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-08-CTLCardinality-2024-15

BK_STOP 1717354073163

--------------------
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-08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/765/ctl_0_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/765/ctl_1_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/765/ctl_2_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/765/ctl_3_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/765/ctl_4_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/765/ctl_5_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/765/ctl_6_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/765/ctl_7_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/765/ctl_8_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/765/ctl_9_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/765/ctl_10_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/765/ctl_11_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/765/ctl_12_
ctl formula name MedleyA-PT-08-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/765/ctl_13_
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-08"
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-08, 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-171734921100057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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