About the Execution of LTSMin+red for FireWire-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
462.367 | 19496.00 | 40244.00 | 86.40 | ??????T????????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.r553-tall-171734901100170.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 FireWire-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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 FireWire-PT-01-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717353225116
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:33:46] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 18:33:46] [INFO ] Transformed 107 places.
[2024-06-02 18:33:46] [INFO ] Transformed 346 transitions.
[2024-06-02 18:33:46] [INFO ] Found NUPN structural information;
[2024-06-02 18:33:46] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 73 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 106 transition count 284
Applied a total of 8 rules in 34 ms. Remains 106 /107 variables (removed 1) and now considering 284/293 (removed 9) transitions.
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 106 cols
[2024-06-02 18:33:46] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:33:47] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 284/293 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 561 ms. Remains : 105/107 places, 284/293 transitions.
Support contains 73 out of 105 places after structural reductions.
[2024-06-02 18:33:47] [INFO ] Flatten gal took : 56 ms
[2024-06-02 18:33:47] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:33:47] [INFO ] Input system was already deterministic with 284 transitions.
RANDOM walk for 40000 steps (2183 resets) in 1988 ms. (20 steps per ms) remains 46/87 properties
BEST_FIRST walk for 4003 steps (22 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (61 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (66 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (52 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (29 resets) in 56 ms. (70 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (54 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (66 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (99 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (63 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (61 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (19 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (50 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (64 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (151 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (63 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (14 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (76 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (70 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (146 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/46 properties
BEST_FIRST walk for 4003 steps (56 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
[2024-06-02 18:33:48] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 105 cols
[2024-06-02 18:33:48] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 18:33:48] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/98 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 33 unsolved
[2024-06-02 18:33:49] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 4 ms to minimize.
[2024-06-02 18:33:49] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 255/357 variables, 102/111 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 38/149 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/149 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 4/361 variables, 2/151 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/152 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/152 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 1/363 variables, 1/153 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 153 constraints, problems are : Problem set: 7 solved, 33 unsolved in 2255 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 7 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/98 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 9 solved, 31 unsolved
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/11 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 255/357 variables, 102/113 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 38/151 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 30/181 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/181 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 4/361 variables, 2/183 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 1/184 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/184 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/185 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 1/363 variables, 1/186 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 0/186 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 0/363 variables, 0/186 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 186 constraints, problems are : Problem set: 9 solved, 31 unsolved in 4741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 31/40 constraints, Known Traps: 4/4 constraints]
After SMT, in 7110ms problems are : Problem set: 9 solved, 31 unsolved
Parikh walk visited 3 properties in 1261 ms.
Support contains 37 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 104 transition count 279
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 103 transition count 279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 101 transition count 274
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 101 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 100 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 99 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 99 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 99 transition count 271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 99 transition count 273
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 98 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 98 transition count 269
Applied a total of 24 rules in 76 ms. Remains 98 /105 variables (removed 7) and now considering 269/284 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 98/105 places, 269/284 transitions.
RANDOM walk for 40000 steps (2434 resets) in 444 ms. (89 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (72 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (58 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (78 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (69 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (75 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (68 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (68 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (219 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (58 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (208 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (48 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (69 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (63 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
[2024-06-02 18:33:57] [INFO ] Flow matrix only has 244 transitions (discarded 25 similar events)
// Phase 1: matrix 244 rows 98 cols
[2024-06-02 18:33:57] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:33:57] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:33:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 4/96 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 243/339 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 3/342 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 145 constraints, problems are : Problem set: 0 solved, 25 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 58/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:33:58] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 4/96 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 243/339 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:33:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 172 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
After SMT, in 2844ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 3 properties in 1922 ms.
Support contains 30 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 269/269 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 97 transition count 267
Applied a total of 3 rules in 21 ms. Remains 97 /98 variables (removed 1) and now considering 267/269 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 97/98 places, 267/269 transitions.
RANDOM walk for 40000 steps (2488 resets) in 367 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (55 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (64 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (67 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (17 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (62 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (73 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (78 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (62 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (218 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (79 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (86 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (212 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (67 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (35 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (68 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 384707 steps, run visited all 22 properties in 1039 ms. (steps per millisecond=370 )
Probabilistic random walk after 384707 steps, saw 85131 distinct states, run finished after 1051 ms. (steps per millisecond=366 ) properties seen :22
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-01-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:34:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-01-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 59 out of 105 places (down from 65) after GAL structural reductions.
Computed a total of 6 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 272
Applied a total of 10 rules in 5 ms. Remains 100 /105 variables (removed 5) and now considering 272/284 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 100/105 places, 272/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 6 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 36 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 5 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 4 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 104 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 103 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 99 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 99 transition count 272
Applied a total of 12 rules in 12 ms. Remains 99 /105 variables (removed 6) and now considering 272/284 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 99/105 places, 272/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 2 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 277
Applied a total of 6 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 277/284 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/105 places, 277/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 13 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:03] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 275
Applied a total of 8 rules in 2 ms. Remains 101 /105 variables (removed 4) and now considering 275/284 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 101/105 places, 275/284 transitions.
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:34:04] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 272
Applied a total of 10 rules in 2 ms. Remains 100 /105 variables (removed 5) and now considering 272/284 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/105 places, 272/284 transitions.
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:34:04] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 13 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 275
Applied a total of 8 rules in 3 ms. Remains 101 /105 variables (removed 4) and now considering 275/284 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 101/105 places, 275/284 transitions.
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Input system was already deterministic with 275 transitions.
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:34:04] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 18:34:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 284 transitions and 1022 arcs took 2 ms.
Total runtime 17999 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 : FireWire-PT-01-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-01-CTLFireability-2024-14
BK_STOP 1717353244612
--------------------
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 FireWire-PT-01-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/540/ctl_0_
ctl formula name FireWire-PT-01-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/540/ctl_1_
ctl formula name FireWire-PT-01-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/540/ctl_2_
ctl formula name FireWire-PT-01-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/540/ctl_3_
ctl formula name FireWire-PT-01-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/540/ctl_4_
ctl formula name FireWire-PT-01-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/540/ctl_5_
ctl formula name FireWire-PT-01-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/540/ctl_6_
ctl formula name FireWire-PT-01-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/540/ctl_7_
ctl formula name FireWire-PT-01-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/540/ctl_8_
ctl formula name FireWire-PT-01-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/540/ctl_9_
ctl formula name FireWire-PT-01-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/540/ctl_10_
ctl formula name FireWire-PT-01-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/540/ctl_11_
ctl formula name FireWire-PT-01-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/540/ctl_12_
ctl formula name FireWire-PT-01-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/540/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-01"
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 FireWire-PT-01, 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 r553-tall-171734901100170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-01.tgz
mv FireWire-PT-01 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 '
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 ;