About the Execution of LTSMin+red for MedleyA-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 498.991 | 46259.00 | 81220.00 | 342.30 | ??????????F????? | 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-171734921000009.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921000009
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K 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 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 48K 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-02-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717351520775
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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:05:23] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-02 18:05:23] [INFO ] Transformed 69 places.
[2024-06-02 18:05:24] [INFO ] Transformed 168 transitions.
[2024-06-02 18:05:24] [INFO ] Found NUPN structural information;
[2024-06-02 18:05:24] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 61 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Applied a total of 0 rules in 24 ms. Remains 69 /69 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 69 cols
[2024-06-02 18:05:24] [INFO ] Computed 9 invariants in 26 ms
[2024-06-02 18:05:24] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-02 18:05:24] [INFO ] Invariant cache hit.
[2024-06-02 18:05:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:05:24] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-02 18:05:25] [INFO ] Invariant cache hit.
[2024-06-02 18:05:25] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 23 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 162/231 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 60/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 222 constraints, problems are : Problem set: 0 solved, 161 unsolved in 11270 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 162/231 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 60/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 161/383 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:40] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:05:42] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:43] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 386 constraints, problems are : Problem set: 0 solved, 161 unsolved in 16358 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 18/18 constraints]
After SMT, in 28163ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 28198ms
Finished structural reductions in LTL mode , in 1 iterations and 29012 ms. Remains : 69/69 places, 162/162 transitions.
Support contains 61 out of 69 places after structural reductions.
[2024-06-02 18:05:53] [INFO ] Flatten gal took : 82 ms
[2024-06-02 18:05:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:05:53] [INFO ] Flatten gal took : 38 ms
[2024-06-02 18:05:53] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 59 out of 69 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 64
RANDOM walk for 40000 steps (4016 resets) in 4072 ms. (9 steps per ms) remains 14/64 properties
BEST_FIRST walk for 40002 steps (1035 resets) in 349 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (948 resets) in 195 ms. (204 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (927 resets) in 120 ms. (330 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (903 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (919 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (913 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (936 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (924 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (939 resets) in 143 ms. (277 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (902 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (929 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (914 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (928 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
[2024-06-02 18:05:55] [INFO ] Invariant cache hit.
[2024-06-02 18:05:55] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (OVERLAPS) 40/58 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 40/64 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 7/65 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 7/75 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/77 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 160/226 variables, 66/143 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 60/203 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 5/231 variables, 3/206 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 3/209 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/231 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 209 constraints, problems are : Problem set: 2 solved, 9 unsolved in 587 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 46/58 variables, 6/18 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 46/64 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 5/71 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 7/65 variables, 2/73 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 7/80 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/66 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/83 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 160/226 variables, 66/149 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 60/209 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/216 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 5/221 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 1/222 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 0/222 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 5/231 variables, 3/225 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/231 variables, 3/228 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/231 variables, 2/230 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:59] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:05:59] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:05:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/231 variables, 3/233 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/231 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:05:59] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/231 variables, 1/234 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/231 variables, 2/236 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/231 variables, 3/239 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/231 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 18:06:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
SMT process timed out in 5648ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 288 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 56 transition count 144
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 56 transition count 144
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 0 with 2 rules applied. Total rules applied 25 place count 55 transition count 143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 52 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 52 transition count 156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 52 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 51 transition count 156
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 51 transition count 156
Applied a total of 44 rules in 71 ms. Remains 51 /69 variables (removed 18) and now considering 156/162 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 51/69 places, 156/162 transitions.
RANDOM walk for 40000 steps (6064 resets) in 541 ms. (73 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (1611 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1703 resets) in 396 ms. (100 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (1723 resets) in 483 ms. (82 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (1667 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
// Phase 1: matrix 156 rows 51 cols
[2024-06-02 18:06:02] [INFO ] Computed 9 invariants in 5 ms
[2024-06-02 18:06:02] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/48 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:06:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 156/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 69/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/207 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 130 constraints, problems are : Problem set: 0 solved, 4 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/48 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 156/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 69/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:06:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/207 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 4 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 332 ms.
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 156/156 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 146
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 0 with 4 rules applied. Total rules applied 6 place count 48 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 46 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 44 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 44 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 43 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 43 transition count 125
Applied a total of 16 rules in 30 ms. Remains 43 /51 variables (removed 8) and now considering 125/156 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 43/51 places, 125/156 transitions.
RANDOM walk for 40000 steps (7136 resets) in 274 ms. (145 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (1709 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1767 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
// Phase 1: matrix 125 rows 43 cols
[2024-06-02 18:06:03] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:06:03] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/40 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 125/167 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 60/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/40 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/167 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 60/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/168 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 125/125 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 40 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 39 transition count 112
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 39 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 38 transition count 112
Applied a total of 11 rules in 41 ms. Remains 38 /43 variables (removed 5) and now considering 112/125 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 38/43 places, 112/125 transitions.
RANDOM walk for 40000 steps (8496 resets) in 210 ms. (189 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (2151 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
// Phase 1: matrix 112 rows 38 cols
[2024-06-02 18:06:04] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:06:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/149 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 56/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/149 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 56/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/150 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/150 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 112/112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 111
Applied a total of 2 rules in 10 ms. Remains 37 /38 variables (removed 1) and now considering 111/112 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 37/38 places, 111/112 transitions.
RANDOM walk for 40000 steps (8563 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2130 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 967 steps, run visited all 1 properties in 17 ms. (steps per millisecond=56 )
Probabilistic random walk after 967 steps, saw 393 distinct states, run finished after 25 ms. (steps per millisecond=38 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 20 stabilizing places and 69 stable transitions
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 143
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 54 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 54 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 53 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 53 transition count 134
Applied a total of 32 rules in 7 ms. Remains 53 /69 variables (removed 16) and now considering 134/162 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 53/69 places, 134/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 140
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 51 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 51 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 114
Applied a total of 38 rules in 6 ms. Remains 50 /69 variables (removed 19) and now considering 114/162 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 50/69 places, 114/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 51 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 115
Applied a total of 38 rules in 6 ms. Remains 50 /69 variables (removed 19) and now considering 115/162 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 50/69 places, 115/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 51 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 51 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 48 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 48 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 44 place count 48 transition count 117
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 48 place count 46 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 45 transition count 116
Applied a total of 50 rules in 39 ms. Remains 45 /69 variables (removed 24) and now considering 116/162 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 45/69 places, 116/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 49 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 48 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 48 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 47 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 47 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 42 place count 47 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 46 transition count 107
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 0 with 4 rules applied. Total rules applied 48 place count 44 transition count 105
Applied a total of 48 rules in 17 ms. Remains 44 /69 variables (removed 25) and now considering 105/162 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 44/69 places, 105/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 52 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 52 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 130
Applied a total of 36 rules in 4 ms. Remains 51 /69 variables (removed 18) and now considering 130/162 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/69 places, 130/162 transitions.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 54 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 54 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 53 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 53 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 52 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 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 0 with 4 rules applied. Total rules applied 35 place count 50 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 50 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 39 place count 50 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 49 transition count 125
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 0 with 4 rules applied. Total rules applied 45 place count 47 transition count 123
Applied a total of 45 rules in 18 ms. Remains 47 /69 variables (removed 22) and now considering 123/162 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 47/69 places, 123/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 56 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 56 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 53 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 53 transition count 125
Applied a total of 32 rules in 2 ms. Remains 53 /69 variables (removed 16) and now considering 125/162 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/69 places, 125/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 51 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 51 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 49 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 49 transition count 121
Applied a total of 40 rules in 4 ms. Remains 49 /69 variables (removed 20) and now considering 121/162 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/69 places, 121/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 53 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 53 transition count 130
Applied a total of 32 rules in 2 ms. Remains 53 /69 variables (removed 16) and now considering 130/162 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/69 places, 130/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 52 transition count 137
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 52 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 128
Applied a total of 38 rules in 4 ms. Remains 50 /69 variables (removed 19) and now considering 128/162 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/69 places, 128/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 52 transition count 137
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 49 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 49 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 48 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 48 transition count 116
Applied a total of 42 rules in 4 ms. Remains 48 /69 variables (removed 21) and now considering 116/162 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/69 places, 116/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 142
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 53 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 53 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 52 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 52 transition count 127
Applied a total of 34 rules in 3 ms. Remains 52 /69 variables (removed 17) and now considering 127/162 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/69 places, 127/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 50 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 50 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 49 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 49 transition count 118
Applied a total of 40 rules in 4 ms. Remains 49 /69 variables (removed 20) and now considering 118/162 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/69 places, 118/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 52 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 120
Applied a total of 36 rules in 3 ms. Remains 51 /69 variables (removed 18) and now considering 120/162 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/69 places, 120/162 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:06] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:06:06] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2024-06-02 18:06:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 162 transitions and 753 arcs took 5 ms.
Total runtime 42860 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-07
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-02-CTLCardinality-2024-15
BK_STOP 1717351567034
--------------------
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-02-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/685/ctl_0_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/685/ctl_1_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/685/ctl_2_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/685/ctl_3_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/685/ctl_4_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/685/ctl_5_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/685/ctl_6_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/685/ctl_7_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/685/ctl_8_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/685/ctl_9_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/685/ctl_10_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/685/ctl_11_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/685/ctl_12_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/685/ctl_13_
ctl formula name MedleyA-PT-02-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/685/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-02"
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-02, 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-171734921000009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-02.tgz
mv MedleyA-PT-02 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 '
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 ;