About the Execution of GreatSPN+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 |
| 642.151 | 102711.00 | 171516.00 | 348.60 | FFTFFFTTFFFFTFFF | 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.r549-tall-171734898000186.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 greatspnxred
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 r549-tall-171734898000186
=====================================================================
--------------------
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 1717365397193
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:56:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:56:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:56:38] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 21:56:38] [INFO ] Transformed 112 places.
[2024-06-02 21:56:38] [INFO ] Transformed 356 transitions.
[2024-06-02 21:56:38] [INFO ] Found NUPN structural information;
[2024-06-02 21:56:38] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 173 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 21:56:38] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 21:56:38] [INFO ] Computed 9 invariants in 18 ms
[2024-06-02 21:56:38] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-02 21:56:38] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 21:56:38] [INFO ] Invariant cache hit.
[2024-06-02 21:56:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 21:56:39] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 21:56:39] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 21:56:39] [INFO ] Invariant cache hit.
[2024-06-02 21:56:39] [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 21:56:41] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 6 ms to minimize.
[2024-06-02 21:56:41] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
[2024-06-02 21:56:41] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:56:41] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:56:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:56:42] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:56:42] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 21:56:42] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 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 13092 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 19315 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 32685ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 32706ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33169 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-06-02 21:57:11] [INFO ] Flatten gal took : 46 ms
[2024-06-02 21:57:11] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:57:12] [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 (1941 resets) in 1462 ms. (27 steps per ms) remains 43/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (44 resets) in 49 ms. (80 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 39/43 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (85 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (18 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (77 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (86 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (79 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (50 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (72 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (54 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (48 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (53 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (59 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (84 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
[2024-06-02 21:57:12] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 21:57:12] [INFO ] Invariant cache hit.
[2024-06-02 21:57:12] [INFO ] State equation strengthened by 41 read => feed constraints.
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 21:57:13] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:57:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:57:13] [INFO ] Deduced a trap composed of 22 places in 58 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 1798 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/33 variables, 33/33 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 73/106 variables, 6/39 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 73/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 21:57:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:57:14] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/126 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/126 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/238 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/278 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 27/305 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/305 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/306 constraints. Problems are: Problem set: 11 solved, 27 unsolved
[2024-06-02 21:57:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 1/307 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/307 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 17 (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 2837 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 4689ms problems are : Problem set: 11 solved, 27 unsolved
Parikh walk visited 1 properties in 7249 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 0 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 1 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
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 106 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 105 transition count 286
Applied a total of 23 rules in 51 ms. Remains 105 /112 variables (removed 7) and now considering 286/297 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 105/112 places, 286/297 transitions.
RANDOM walk for 40000 steps (2314 resets) in 771 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (53 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (115 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (70 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (103 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (105 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (52 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (115 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 668473 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :7 out of 24
Probabilistic random walk after 668473 steps, saw 117628 distinct states, run finished after 3004 ms. (steps per millisecond=222 ) properties seen :7
[2024-06-02 21:57:28] [INFO ] Flow matrix only has 261 transitions (discarded 25 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 21:57:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:57:28] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 58/81 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 58/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 21:57:28] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 236/317 variables, 81/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 27/195 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 46/363 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 22/239 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 12/253 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 3/366 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 0/366 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 258 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1124 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 58/81 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 58/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 236/317 variables, 81/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 27/195 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 46/363 variables, 22/222 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 12/258 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 21:57:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 3/366 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 0/366 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 276 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2032 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 3180ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 2486 ms.
Support contains 23 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 286/286 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 100 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 100 transition count 276
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 0 with 3 rules applied. Total rules applied 14 place count 99 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 99 transition count 272
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 99 transition count 272
Applied a total of 18 rules in 34 ms. Remains 99 /105 variables (removed 6) and now considering 272/286 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 99/105 places, 272/286 transitions.
RANDOM walk for 40000 steps (2320 resets) in 227 ms. (175 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (106 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (13 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (50 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (63 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (115 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (63 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (68 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 612707 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 17
Probabilistic random walk after 612707 steps, saw 116558 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-06-02 21:57:37] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 99 cols
[2024-06-02 21:57:37] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:57:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 54/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 43/342 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/345 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 145 constraints, problems are : Problem set: 0 solved, 17 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 54/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 43/342 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 11/147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 21:57:38] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 3/345 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/345 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 163 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 2317ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 1275 ms.
Support contains 23 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 99/99 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-02 21:57:40] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 21:57:40] [INFO ] Invariant cache hit.
[2024-06-02 21:57:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 21:57:40] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 21:57:40] [INFO ] Invariant cache hit.
[2024-06-02 21:57:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:57:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 21:57:40] [INFO ] Redundant transitions in 19 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 21:57:40] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 21:57:40] [INFO ] Invariant cache hit.
[2024-06-02 21:57:40] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:57:41] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:57:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:57:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:57:42] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:57:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:57:45] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 246/345 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:57:49] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/345 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 155 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 270/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 425 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
After SMT, in 26479ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26482ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26684 ms. Remains : 99/99 places, 272/272 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 67 edges and 99 vertex of which 16 / 99 are part of one of the 3 SCC in 3 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 190
Applied a total of 12 rules in 15 ms. Remains 86 /99 variables (removed 13) and now considering 190/272 (removed 82) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 190 rows 86 cols
[2024-06-02 21:58:07] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:58:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:58:07] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 21:58:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:58:07] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2024-06-02 21:58:08] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
[2024-06-02 21:58:08] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Over-approximation ignoring read arcs solved 0 properties in 856 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-06-02 21:58:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 17 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 21:58:08] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:58:08] [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 6 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 6 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 33 ms
[2024-06-02 21:58:08] [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 6 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 6 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:58:08] [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 33 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 34 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:58:08] [INFO ] Input system was already deterministic with 278 transitions.
RANDOM walk for 40000 steps (2462 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 162 ms. (245 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 7 ms. (steps per millisecond=37 ) 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 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 31 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 31 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:58:08] [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 4 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:08] [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 21:58:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:08] [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 21:58:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:08] [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 21:58:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:08] [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 2 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 21:58:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:58:09] [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 2 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 2 ms. Remains : 111/112 places, 295/297 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:58:09] [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 2 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 2 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:09] [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 2 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 2 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:09] [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 2 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 2 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [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 17 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 17 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:58:09] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:09] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 21:58:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 297 transitions and 1076 arcs took 3 ms.
Total runtime 90988 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-03
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 112
TRANSITIONS: 297
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 679
MODEL NAME: /home/mcc/execution/409/model
112 places, 297 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-03-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-03-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717365499904
--------------------
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
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="greatspnxred"
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 greatspnxred"
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 r549-tall-171734898000186"
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 ;