fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r579-smll-171734921100042
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MedleyA-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
373.495 49193.00 92676.00 253.80 ????T??????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921100042.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 33K 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-06-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352986180

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:29:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:29:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:29:48] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-02 18:29:48] [INFO ] Transformed 124 places.
[2024-06-02 18:29:48] [INFO ] Transformed 118 transitions.
[2024-06-02 18:29:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:29:48] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Support contains 90 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 115
Applied a total of 6 rules in 49 ms. Remains 121 /124 variables (removed 3) and now considering 115/118 (removed 3) transitions.
// Phase 1: matrix 115 rows 121 cols
[2024-06-02 18:29:49] [INFO ] Computed 24 invariants in 29 ms
[2024-06-02 18:29:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-02 18:29:49] [INFO ] Invariant cache hit.
[2024-06-02 18:29:49] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-02 18:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:29:52] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 33 ms to minimize.
[2024-06-02 18:29:52] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 3 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 3 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 2 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 21 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 12 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:29:57] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:29:57] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:29:57] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:29:58] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:29:59] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 3 ms to minimize.
[2024-06-02 18:29:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 115/236 variables, 121/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 186 constraints, problems are : Problem set: 0 solved, 114 unsolved in 13055 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 41/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/236 variables, 121/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 114/300 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:30:06] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-06-02 18:30:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:30:07] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:30:07] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:30:11] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/236 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 305 constraints, problems are : Problem set: 0 solved, 114 unsolved in 14816 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 46/46 constraints]
After SMT, in 28042ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 28079ms
Starting structural reductions in LTL mode, iteration 1 : 121/124 places, 115/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28968 ms. Remains : 121/124 places, 115/118 transitions.
Support contains 90 out of 121 places after structural reductions.
[2024-06-02 18:30:18] [INFO ] Flatten gal took : 50 ms
[2024-06-02 18:30:18] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:30:18] [INFO ] Input system was already deterministic with 115 transitions.
Support contains 89 out of 121 places (down from 90) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 71 to 70
RANDOM walk for 40000 steps (1111 resets) in 2601 ms. (15 steps per ms) remains 17/70 properties
BEST_FIRST walk for 4002 steps (20 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (22 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (29 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (25 resets) in 68 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (25 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (21 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (25 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (29 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (28 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
[2024-06-02 18:30:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/92 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 5/97 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 6 (OVERLAPS) 24/121 variables, 10/24 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 115/236 variables, 121/149 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 150 constraints, problems are : Problem set: 2 solved, 13 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 64/87 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:30:20] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/15 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 8/95 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 9 (OVERLAPS) 26/121 variables, 11/29 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 3/32 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-06-02 18:30:21] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:30:21] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 115/236 variables, 121/155 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 12/167 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-06-02 18:30:21] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 12 ms to minimize.
[2024-06-02 18:30:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 2/169 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-06-02 18:30:21] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 12 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 13/13 constraints]
After SMT, in 2247ms problems are : Problem set: 3 solved, 12 unsolved
Parikh walk visited 3 properties in 8585 ms.
Support contains 18 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 117 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 111 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 111 transition count 105
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 107 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 97 transition count 95
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 97 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 95 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 95 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 51 place count 94 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 93 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 92 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 92 transition count 90
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 84 place count 77 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 92 place count 73 transition count 76
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 73 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 100 place count 69 transition count 72
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 103 place count 69 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 106 place count 66 transition count 69
Applied a total of 106 rules in 90 ms. Remains 66 /121 variables (removed 55) and now considering 69/115 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 66/121 places, 69/115 transitions.
RANDOM walk for 40000 steps (1751 resets) in 743 ms. (53 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (417 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (403 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (354 resets) in 113 ms. (350 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (464 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (407 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (511 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (456 resets) in 70 ms. (563 steps per ms) remains 5/6 properties
// Phase 1: matrix 69 rows 66 cols
[2024-06-02 18:30:31] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 18:30:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 23/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:30:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/66 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 69/135 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 91 constraints, problems are : Problem set: 0 solved, 5 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 23/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:32] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/66 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 69/135 variables, 66/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 97 constraints, problems are : Problem set: 0 solved, 5 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 863ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1429 ms.
Support contains 10 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 69/69 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 66 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 63 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 60 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 58 transition count 61
Applied a total of 16 rules in 20 ms. Remains 58 /66 variables (removed 8) and now considering 61/69 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 58/66 places, 61/69 transitions.
RANDOM walk for 40000 steps (2371 resets) in 91 ms. (434 steps per ms) remains 1/5 properties
BEST_FIRST walk for 6180 steps (99 resets) in 12 ms. (475 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:30:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:30:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:30:33] [INFO ] Input system was already deterministic with 115 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 114 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 108 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 108 transition count 102
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 102 transition count 102
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 47 place count 85 transition count 74
Iterating global reduction 2 with 17 rules applied. Total rules applied 64 place count 85 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 64 place count 85 transition count 71
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 82 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 80 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 80 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 77 place count 79 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 78 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 77 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 77 transition count 66
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 116 place count 59 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 58 transition count 47
Applied a total of 117 rules in 64 ms. Remains 58 /121 variables (removed 63) and now considering 47/115 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 58/121 places, 47/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 115
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 15 place count 106 transition count 106
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 106 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 105 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 105 transition count 105
Applied a total of 26 rules in 18 ms. Remains 105 /121 variables (removed 16) and now considering 105/115 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 105/121 places, 105/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 114 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 108 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 108 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 102 transition count 102
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 47 place count 85 transition count 74
Iterating global reduction 2 with 17 rules applied. Total rules applied 64 place count 85 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 64 place count 85 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 82 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 80 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 80 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 77 place count 79 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 78 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 77 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 77 transition count 66
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 118 place count 58 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 57 transition count 46
Applied a total of 119 rules in 40 ms. Remains 57 /121 variables (removed 64) and now considering 46/115 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 57/121 places, 46/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 116 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 15 place count 111 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 111 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 106 transition count 105
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 101 transition count 100
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 101 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 100 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 100 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 99 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 98 transition count 97
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 65 place count 86 transition count 85
Applied a total of 65 rules in 30 ms. Remains 86 /121 variables (removed 35) and now considering 85/115 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 86/121 places, 85/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 114 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 108 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 108 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 103 transition count 103
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 45 place count 86 transition count 75
Iterating global reduction 2 with 17 rules applied. Total rules applied 62 place count 86 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 86 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 83 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 81 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 81 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 75 place count 80 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 79 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 78 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 78 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 114 place count 60 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 59 transition count 48
Applied a total of 115 rules in 38 ms. Remains 59 /121 variables (removed 62) and now considering 48/115 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 59/121 places, 48/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 220 steps (11 resets) in 4 ms. (44 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 103 transition count 102
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 103 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 101 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 101 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 100 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 100 transition count 99
Applied a total of 37 rules in 10 ms. Remains 100 /121 variables (removed 21) and now considering 99/115 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 100/121 places, 99/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 115
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 105 transition count 104
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 105 transition count 104
Applied a total of 27 rules in 4 ms. Remains 105 /121 variables (removed 16) and now considering 104/115 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/121 places, 104/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 115
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 18 place count 103 transition count 103
Iterating global reduction 1 with 12 rules applied. Total rules applied 30 place count 103 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 102 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 102 transition count 102
Applied a total of 32 rules in 5 ms. Remains 102 /121 variables (removed 19) and now considering 102/115 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 102/121 places, 102/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
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 0 with 7 rules applied. Total rules applied 7 place count 115 transition count 112
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 113 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 110 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 110 transition count 106
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 21 place count 107 transition count 106
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 32 place count 96 transition count 95
Iterating global reduction 3 with 11 rules applied. Total rules applied 43 place count 96 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 43 place count 96 transition count 94
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 45 place count 95 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 94 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 94 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 93 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 93 transition count 92
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 79 place count 78 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 78 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 77 transition count 76
Applied a total of 81 rules in 32 ms. Remains 77 /121 variables (removed 44) and now considering 76/115 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 77/121 places, 76/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 115
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 18 place count 103 transition count 103
Iterating global reduction 1 with 12 rules applied. Total rules applied 30 place count 103 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 101 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 101 transition count 101
Applied a total of 34 rules in 6 ms. Remains 101 /121 variables (removed 20) and now considering 101/115 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 101/121 places, 101/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
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 0 with 7 rules applied. Total rules applied 7 place count 115 transition count 112
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 113 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 111 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 111 transition count 108
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 17 place count 109 transition count 108
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 27 place count 99 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 37 place count 99 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 97 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 97 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 97 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 96 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 96 transition count 94
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 78 place count 79 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 78 transition count 76
Applied a total of 79 rules in 21 ms. Remains 78 /121 variables (removed 43) and now considering 76/115 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 78/121 places, 76/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 115
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 22 place count 99 transition count 88
Iterating global reduction 1 with 16 rules applied. Total rules applied 38 place count 99 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 97 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 97 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 96 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 96 transition count 85
Applied a total of 44 rules in 7 ms. Remains 96 /121 variables (removed 25) and now considering 85/115 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 96/121 places, 85/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 103 transition count 102
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 103 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 101 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 101 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 100 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 100 transition count 99
Applied a total of 37 rules in 8 ms. Remains 100 /121 variables (removed 21) and now considering 99/115 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 100/121 places, 99/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 103 transition count 102
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 103 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 101 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 101 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 100 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 100 transition count 99
Applied a total of 37 rules in 7 ms. Remains 100 /121 variables (removed 21) and now considering 99/115 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 100/121 places, 99/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 114 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 108 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 108 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 103 transition count 103
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 45 place count 86 transition count 75
Iterating global reduction 2 with 17 rules applied. Total rules applied 62 place count 86 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 86 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 83 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 81 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 81 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 75 place count 80 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 79 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 78 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 78 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 116 place count 59 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 58 transition count 47
Applied a total of 117 rules in 21 ms. Remains 58 /121 variables (removed 63) and now considering 47/115 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 58/121 places, 47/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 115/115 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 115
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 17 place count 104 transition count 104
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 104 transition count 104
Applied a total of 28 rules in 3 ms. Remains 104 /121 variables (removed 17) and now considering 104/115 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 104/121 places, 104/115 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:30:34] [INFO ] Input system was already deterministic with 104 transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:30:34] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-02 18:30:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 115 transitions and 366 arcs took 3 ms.
Total runtime 46389 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-06-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-06-CTLFireability-2024-15

BK_STOP 1717353035373

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/727/ctl_0_
ctl formula name MedleyA-PT-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/727/ctl_1_
ctl formula name MedleyA-PT-06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/727/ctl_2_
ctl formula name MedleyA-PT-06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/727/ctl_3_
ctl formula name MedleyA-PT-06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/727/ctl_4_
ctl formula name MedleyA-PT-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/727/ctl_5_
ctl formula name MedleyA-PT-06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/727/ctl_6_
ctl formula name MedleyA-PT-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/727/ctl_7_
ctl formula name MedleyA-PT-06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/727/ctl_8_
ctl formula name MedleyA-PT-06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/727/ctl_9_
ctl formula name MedleyA-PT-06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/727/ctl_10_
ctl formula name MedleyA-PT-06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/727/ctl_11_
ctl formula name MedleyA-PT-06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/727/ctl_12_
ctl formula name MedleyA-PT-06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/727/ctl_13_
ctl formula name MedleyA-PT-06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/727/ctl_14_
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-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921100042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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