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-171734898000202.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-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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-05-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717365791187

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:03:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:03:12] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 22:03:12] [INFO ] Transformed 114 places.
[2024-06-02 22:03:12] [INFO ] Transformed 373 transitions.
[2024-06-02 22:03:12] [INFO ] Found NUPN structural information;
[2024-06-02 22:03:12] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
Support contains 70 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 316/316 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 312
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 112 transition count 304
Applied a total of 12 rules in 33 ms. Remains 112 /114 variables (removed 2) and now considering 304/316 (removed 12) transitions.
[2024-06-02 22:03:12] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 112 cols
[2024-06-02 22:03:12] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:03:12] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-02 22:03:12] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 22:03:12] [INFO ] Invariant cache hit.
[2024-06-02 22:03:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:03:13] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [13, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 417 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/114 places, 304/316 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 470 ms. Remains : 110/114 places, 304/316 transitions.
Support contains 70 out of 110 places after structural reductions.
[2024-06-02 22:03:13] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:03:13] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:03:13] [INFO ] Input system was already deterministic with 304 transitions.
Support contains 67 out of 110 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (2192 resets) in 2277 ms. (17 steps per ms) remains 37/76 properties
BEST_FIRST walk for 4001 steps (53 resets) in 54 ms. (72 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (73 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (68 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (63 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (60 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (111 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (146 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (109 resets) in 16 ms. (235 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (83 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (74 resets) in 55 ms. (71 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (50 resets) in 28 ms. (137 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (65 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (68 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (22 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (52 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (51 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (70 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (65 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (107 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 31/35 properties
[2024-06-02 22:03:14] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 110 cols
[2024-06-02 22:03:14] [INFO ] Computed 6 invariants in 10 ms
[2024-06-02 22:03:14] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/104 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/106 variables, 1/6 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 22:03:15] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 275/381 variables, 106/113 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 39/152 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/152 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 5/386 variables, 3/155 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/155 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 1/387 variables, 1/156 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/157 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/157 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/157 constraints. Problems are: Problem set: 6 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 157 constraints, problems are : Problem set: 6 solved, 25 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 66/102 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/6 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 4/106 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:03:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 4/13 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 275/381 variables, 106/119 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 39/158 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 24/182 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/182 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 5/386 variables, 3/185 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 1/186 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 22:03:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 1/187 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 0/187 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 1/387 variables, 1/188 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/387 variables, 0/188 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 1/388 variables, 1/189 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/388 variables, 0/189 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 20 (OVERLAPS) 0/388 variables, 0/189 constraints. Problems are: Problem set: 6 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 189 constraints, problems are : Problem set: 6 solved, 25 unsolved in 4180 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 25/31 constraints, Known Traps: 8/8 constraints]
After SMT, in 5720ms problems are : Problem set: 6 solved, 25 unsolved
Fused 25 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 843 ms.
Support contains 36 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 304/304 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 109 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 109 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 108 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 107 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 107 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 107 transition count 298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 107 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 106 transition count 297
Applied a total of 14 rules in 57 ms. Remains 106 /110 variables (removed 4) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 106/110 places, 297/304 transitions.
RANDOM walk for 40000 steps (2452 resets) in 485 ms. (82 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (68 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (78 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (140 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (210 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (159 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (83 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (73 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (86 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (81 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (58 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (67 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (147 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (149 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 646065 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :24 out of 25
Probabilistic random walk after 646065 steps, saw 137646 distinct states, run finished after 3009 ms. (steps per millisecond=214 ) properties seen :24
[2024-06-02 22:03:24] [INFO ] Flow matrix only has 273 transitions (discarded 24 similar events)
// Phase 1: matrix 273 rows 106 cols
[2024-06-02 22:03:24] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 22:03:24] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/104 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/377 variables, 104/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/379 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:03:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:03:24] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 273/377 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/379 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:03:24] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 11 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 104 transition count 296
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 104 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 104 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 104 transition count 295
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 12 place count 103 transition count 293
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 14 place count 103 transition count 291
Applied a total of 14 rules in 54 ms. Remains 103 /106 variables (removed 3) and now considering 291/297 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 103/106 places, 291/297 transitions.
RANDOM walk for 31288 steps (1901 resets) in 171 ms. (181 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 304 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 5 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 5 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 4 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 4 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 4 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 4 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 298
Applied a total of 7 rules in 17 ms. Remains 106 /110 variables (removed 4) and now considering 298/304 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 106/110 places, 298/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 298 transitions.
RANDOM walk for 40000 steps (2558 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 249 steps, run visited all 1 properties in 4 ms. (steps per millisecond=62 )
Probabilistic random walk after 249 steps, saw 191 distinct states, run finished after 7 ms. (steps per millisecond=35 ) properties seen :1
FORMULA FireWire-PT-05-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 110/110 places, 304/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:25] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 108 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 107 transition count 299
Applied a total of 7 rules in 15 ms. Remains 107 /110 variables (removed 3) and now considering 299/304 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 107/110 places, 299/304 transitions.
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 7 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 3 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 301
Applied a total of 3 rules in 2 ms. Remains 109 /110 variables (removed 1) and now considering 301/304 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 109/110 places, 301/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 298
Applied a total of 7 rules in 15 ms. Remains 106 /110 variables (removed 4) and now considering 298/304 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 106/110 places, 298/304 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:03:26] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:03:26] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 22:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 304 transitions and 1111 arcs took 2 ms.
Total runtime 14051 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 110
TRANSITIONS: 304
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/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: 584
MODEL NAME: /home/mcc/execution/412/model
110 places, 304 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-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365890427

--------------------
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-05"
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-05, 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-171734898000202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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