About the Execution of LTSMin+red for FireWire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 561.644 | 76084.00 | 137885.00 | 197.60 | ??T??????F????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.r553-tall-171734901100186.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-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K 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 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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-03-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717353519019
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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:38:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:38:40] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 18:38:40] [INFO ] Transformed 112 places.
[2024-06-02 18:38:40] [INFO ] Transformed 356 transitions.
[2024-06-02 18:38:40] [INFO ] Found NUPN structural information;
[2024-06-02 18:38:40] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 70 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
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 6 place count 112 transition count 297
Applied a total of 6 rules in 23 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2024-06-02 18:38:40] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 18:38:40] [INFO ] Computed 9 invariants in 19 ms
[2024-06-02 18:38:40] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-02 18:38:40] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:38:40] [INFO ] Invariant cache hit.
[2024-06-02 18:38:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:38:40] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 18:38:40] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:38:40] [INFO ] Invariant cache hit.
[2024-06-02 18:38:40] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 8 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:38:44] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:38:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:38:44] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 13374 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 578 constraints, problems are : Problem set: 0 solved, 296 unsolved in 18976 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
After SMT, in 32625ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 32648ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33129 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-06-02 18:39:13] [INFO ] Flatten gal took : 54 ms
[2024-06-02 18:39:13] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:39:13] [INFO ] Input system was already deterministic with 297 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (2010 resets) in 2443 ms. (16 steps per ms) remains 39/78 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (88 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (66 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (21 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (86 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (86 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (45 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 32 ms. (121 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (82 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (53 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
[2024-06-02 18:39:15] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 18:39:15] [INFO ] Invariant cache hit.
[2024-06-02 18:39:15] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 2 (OVERLAPS) 58/106 variables, 6/54 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 58/112 constraints. Problems are: Problem set: 11 solved, 27 unsolved
[2024-06-02 18:39:15] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:39:15] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:39:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/115 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 6/112 variables, 3/118 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 6/124 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/236 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/276 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/276 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/277 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/277 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/277 constraints. Problems are: Problem set: 11 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 277 constraints, problems are : Problem set: 11 solved, 27 unsolved in 1307 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 11 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 74/106 variables, 6/38 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 74/112 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/115 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 6/112 variables, 3/118 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 6/124 constraints. Problems are: Problem set: 11 solved, 27 unsolved
[2024-06-02 18:39:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:39:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:39:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 3/127 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/127 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/239 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/279 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 27/306 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/306 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/307 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/307 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/307 constraints. Problems are: Problem set: 11 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 307 constraints, problems are : Problem set: 11 solved, 27 unsolved in 2624 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 27/38 constraints, Known Traps: 6/6 constraints]
After SMT, in 3982ms problems are : Problem set: 11 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 7911 ms.
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 293
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 1 with 4 rules applied. Total rules applied 9 place count 109 transition count 291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 107 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 107 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 107 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 107 transition count 289
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 2 with 3 rules applied. Total rules applied 25 place count 106 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 106 transition count 285
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 106 transition count 285
Applied a total of 29 rules in 66 ms. Remains 106 /112 variables (removed 6) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 106/112 places, 285/297 transitions.
RANDOM walk for 40000 steps (2204 resets) in 1359 ms. (29 steps per ms) remains 22/27 properties
BEST_FIRST walk for 4001 steps (55 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (92 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (60 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (105 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (105 resets) in 20 ms. (190 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 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (55 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (64 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (46 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (105 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (50 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
[2024-06-02 18:39:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 106 cols
[2024-06-02 18:39:27] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:39:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 72/101 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 72/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:39:27] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:39:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:39:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 5/106 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:39:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 259/365 variables, 106/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 41/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 266 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1193 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 72/101 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 72/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 5/106 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 259/365 variables, 106/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 41/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 22/288 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/365 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 289 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1697 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 1513 ms.
Support contains 29 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 285/285 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 282
Applied a total of 4 rules in 32 ms. Remains 103 /106 variables (removed 3) and now considering 282/285 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 103/106 places, 282/285 transitions.
RANDOM walk for 40000 steps (2323 resets) in 465 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (53 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (100 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (57 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (12 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (117 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (108 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (60 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (54 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (54 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (109 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (53 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 569738 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :6 out of 21
Probabilistic random walk after 569738 steps, saw 111425 distinct states, run finished after 3004 ms. (steps per millisecond=189 ) properties seen :6
[2024-06-02 18:39:35] [INFO ] Flow matrix only has 256 transitions (discarded 26 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 18:39:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:39:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 58/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 18:39:35] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 231/310 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 46/356 variables, 22/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/359 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/359 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 151 constraints, problems are : Problem set: 0 solved, 15 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 58/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 231/310 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 46/356 variables, 22/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 11/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 18:39:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:39:36] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:39:36] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 3/359 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/359 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 169 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 2458ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 9 properties in 15186 ms.
Support contains 12 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 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 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 100 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 100 transition count 275
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 98 transition count 271
Applied a total of 10 rules in 33 ms. Remains 98 /103 variables (removed 5) and now considering 271/282 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 98/103 places, 271/282 transitions.
RANDOM walk for 40000 steps (2392 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (630 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (519 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (609 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (611 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 213079 steps, run visited all 6 properties in 562 ms. (steps per millisecond=379 )
Probabilistic random walk after 213079 steps, saw 48022 distinct states, run finished after 568 ms. (steps per millisecond=375 ) properties seen :6
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:39:53] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 27 ms
FORMULA FireWire-PT-03-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:39:53] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 49 out of 112 places (down from 53) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:39:53] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:39:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:39:53] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
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 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
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 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 32 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 278 transitions.
RANDOM walk for 40000 steps (2489 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (18 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 261 steps, run visited all 1 properties in 3 ms. (steps per millisecond=87 )
Probabilistic random walk after 261 steps, saw 202 distinct states, run finished after 3 ms. (steps per millisecond=87 ) properties seen :1
FORMULA FireWire-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
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 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
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 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 29 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 296
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 111 transition count 296
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 108 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 284
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 16 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 280
Applied a total of 18 rules in 19 ms. Remains 104 /112 variables (removed 8) and now considering 280/297 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 104/112 places, 280/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 3 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/112 places, 290/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 295
Applied a total of 2 rules in 1 ms. Remains 111 /112 variables (removed 1) and now considering 295/297 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/112 places, 295/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:54] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 18:39:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 297 transitions and 1076 arcs took 2 ms.
Total runtime 74564 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-03-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-03-CTLFireability-2024-15
BK_STOP 1717353595103
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-03-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/609/ctl_0_
ctl formula name FireWire-PT-03-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/609/ctl_1_
ctl formula name FireWire-PT-03-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/609/ctl_2_
ctl formula name FireWire-PT-03-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/609/ctl_3_
ctl formula name FireWire-PT-03-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/609/ctl_4_
ctl formula name FireWire-PT-03-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/609/ctl_5_
ctl formula name FireWire-PT-03-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/609/ctl_6_
ctl formula name FireWire-PT-03-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/609/ctl_7_
ctl formula name FireWire-PT-03-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/609/ctl_8_
ctl formula name FireWire-PT-03-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/609/ctl_9_
ctl formula name FireWire-PT-03-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/609/ctl_10_
ctl formula name FireWire-PT-03-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/609/ctl_11_
ctl formula name FireWire-PT-03-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/609/ctl_12_
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-03"
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-03, 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-171734901100186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-03.tgz
mv FireWire-PT-03 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 ;