fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r549-tall-171734898100242
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8984.275 694539.00 1718059.00 904.80 FTFFFTTTTTFTFFTF 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-171734898100242.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 49K 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 25K 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 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K 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 101K 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-10-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717367016219

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:23:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:23:37] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 22:23:37] [INFO ] Transformed 131 places.
[2024-06-02 22:23:37] [INFO ] Transformed 409 transitions.
[2024-06-02 22:23:37] [INFO ] Found NUPN structural information;
[2024-06-02 22:23:37] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 77 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 349
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 129 transition count 348
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 11 place count 129 transition count 342
Applied a total of 11 rules in 32 ms. Remains 129 /131 variables (removed 2) and now considering 342/353 (removed 11) transitions.
[2024-06-02 22:23:37] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
// Phase 1: matrix 316 rows 129 cols
[2024-06-02 22:23:37] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:23:37] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-02 22:23:37] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
[2024-06-02 22:23:37] [INFO ] Invariant cache hit.
[2024-06-02 22:23:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:23:38] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 504 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 342/353 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 556 ms. Remains : 127/131 places, 342/353 transitions.
Support contains 77 out of 127 places after structural reductions.
[2024-06-02 22:23:38] [INFO ] Flatten gal took : 54 ms
[2024-06-02 22:23:38] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:23:38] [INFO ] Input system was already deterministic with 342 transitions.
RANDOM walk for 40000 steps (2161 resets) in 1431 ms. (27 steps per ms) remains 45/73 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (18 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (59 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (51 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (99 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (48 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (109 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (61 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (58 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (102 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/45 properties
BEST_FIRST walk for 4004 steps (108 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (67 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (127 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (56 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (68 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (50 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (111 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (58 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (104 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (149 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
[2024-06-02 22:23:39] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
// Phase 1: matrix 316 rows 127 cols
[2024-06-02 22:23:39] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:23:39] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/122 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 34 unsolved
[2024-06-02 22:23:39] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 10 ms to minimize.
[2024-06-02 22:23:39] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:23:39] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:23:39] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 315/437 variables, 122/132 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/176 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 5/442 variables, 5/181 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/182 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/443 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 182 constraints, problems are : Problem set: 4 solved, 34 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 34 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/122 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/10 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-06-02 22:23:41] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:23:41] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-06-02 22:23:41] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/13 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 315/437 variables, 122/135 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 44/179 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 30/209 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/209 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 5/442 variables, 5/214 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 2/216 constraints. Problems are: Problem set: 6 solved, 32 unsolved
[2024-06-02 22:23:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 1/217 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/217 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 1/443 variables, 1/218 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/218 constraints. Problems are: Problem set: 6 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/443 variables, 0/218 constraints. Problems are: Problem set: 6 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 218 constraints, problems are : Problem set: 6 solved, 32 unsolved in 4649 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/38 constraints, Known Traps: 8/8 constraints]
After SMT, in 6564ms problems are : Problem set: 6 solved, 32 unsolved
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 14 properties in 5969 ms.
Support contains 27 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 342/342 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 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 126 transition count 337
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 126 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 126 transition count 336
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 123 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 123 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 123 transition count 333
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 123 transition count 333
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 120 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 120 transition count 329
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 119 transition count 328
Applied a total of 32 rules in 98 ms. Remains 119 /127 variables (removed 8) and now considering 328/342 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 119/127 places, 328/342 transitions.
RANDOM walk for 40000 steps (2313 resets) in 806 ms. (49 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (61 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (45 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (104 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (58 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (117 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (52 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (62 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (58 resets) in 12 ms. (307 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (46 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (103 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (114 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
[2024-06-02 22:23:52] [INFO ] Flow matrix only has 299 transitions (discarded 29 similar events)
// Phase 1: matrix 299 rows 119 cols
[2024-06-02 22:23:52] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:23:52] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 90/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:23:52] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:23:52] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 299/410 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 8/418 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 172 constraints, problems are : Problem set: 0 solved, 15 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 90/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 299/410 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 8/418 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 191 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 6/6 constraints]
After SMT, in 2612ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 13045 ms.
Support contains 21 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 328/328 transitions.
Applied a total of 0 rules in 23 ms. Remains 119 /119 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 119/119 places, 328/328 transitions.
RANDOM walk for 40000 steps (2315 resets) in 249 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (58 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (110 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (109 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (53 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (65 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (71 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (111 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (117 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 697289 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :7 out of 15
Probabilistic random walk after 697289 steps, saw 151487 distinct states, run finished after 3005 ms. (steps per millisecond=232 ) properties seen :7
[2024-06-02 22:24:11] [INFO ] Flow matrix only has 299 transitions (discarded 29 similar events)
[2024-06-02 22:24:11] [INFO ] Invariant cache hit.
[2024-06-02 22:24:11] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 277/367 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 33/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 51/418 variables, 29/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 170 constraints, problems are : Problem set: 0 solved, 8 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:24:11] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 277/367 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 51/418 variables, 29/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:24:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/418 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/418 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 180 constraints, problems are : Problem set: 0 solved, 8 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1148ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5254 ms.
Support contains 12 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 326
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 118 transition count 325
Applied a total of 3 rules in 15 ms. Remains 118 /119 variables (removed 1) and now considering 325/328 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 118/119 places, 325/328 transitions.
RANDOM walk for 40000 steps (2311 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1109 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (66 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (546 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (619 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (568 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1128 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1113 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 732751 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 8
Probabilistic random walk after 732751 steps, saw 158639 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2024-06-02 22:24:20] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
// Phase 1: matrix 296 rows 118 cols
[2024-06-02 22:24:20] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:24:20] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 77/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 274/363 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 33/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 51/414 variables, 29/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 169 constraints, problems are : Problem set: 0 solved, 8 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 77/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 274/363 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 33/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 51/414 variables, 29/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:24:21] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/414 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 179 constraints, problems are : Problem set: 0 solved, 8 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1198ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1475 ms.
Support contains 12 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 325/325 transitions.
Applied a total of 0 rules in 15 ms. Remains 118 /118 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 118/118 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-06-02 22:24:23] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:24:23] [INFO ] Invariant cache hit.
[2024-06-02 22:24:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:24:23] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:24:23] [INFO ] Invariant cache hit.
[2024-06-02 22:24:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:24:23] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-06-02 22:24:23] [INFO ] Redundant transitions in 18 ms returned []
Running 323 sub problems to find dead transitions.
[2024-06-02 22:24:23] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:24:23] [INFO ] Invariant cache hit.
[2024-06-02 22:24:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:24:25] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:24:26] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:24:26] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 296/413 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:24:29] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 178 constraints, problems are : Problem set: 0 solved, 323 unsolved in 14462 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (OVERLAPS) 296/413 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 323/500 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:24:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:24:45] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:24:48] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (OVERLAPS) 1/414 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 504 constraints, problems are : Problem set: 0 solved, 323 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 12/12 constraints]
After SMT, in 44749ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 44754ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45040 ms. Remains : 118/118 places, 325/325 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 92 edges and 118 vertex of which 25 / 118 are part of one of the 3 SCC in 2 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 95 transition count 209
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 95 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 94 transition count 208
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 94 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 94 transition count 207
Applied a total of 14 rules in 24 ms. Remains 94 /118 variables (removed 24) and now considering 207/325 (removed 118) transitions.
Running SMT prover for 8 properties.
[2024-06-02 22:25:08] [INFO ] Flow matrix only has 205 transitions (discarded 2 similar events)
// Phase 1: matrix 205 rows 94 cols
[2024-06-02 22:25:08] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:25:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:25:08] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 22:25:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:25:09] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 22:25:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 22:25:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-02 22:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-06-02 22:25:09] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 22:25:09] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 842 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-10-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:25:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 19 ms
FORMULA FireWire-PT-10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 342 transitions.
Support contains 54 out of 127 places (down from 58) after GAL structural reductions.
Computed a total of 22 stabilizing places and 46 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
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 1 with 2 rules applied. Total rules applied 26 place count 115 transition count 312
Applied a total of 26 rules in 35 ms. Remains 115 /127 variables (removed 12) and now considering 312/342 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 115/127 places, 312/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Applied a total of 30 rules in 15 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Applied a total of 28 rules in 13 ms. Remains 114 /127 variables (removed 13) and now considering 309/342 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 114/127 places, 309/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Applied a total of 30 rules in 14 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 338
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 125 transition count 336
Applied a total of 6 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:25:09] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 306
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 1 with 2 rules applied. Total rules applied 32 place count 111 transition count 305
Applied a total of 32 rules in 37 ms. Remains 111 /127 variables (removed 16) and now considering 305/342 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 111/127 places, 305/342 transitions.
[2024-06-02 22:25:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 40000 steps (2335 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (14 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2360 steps, run visited all 1 properties in 9 ms. (steps per millisecond=262 )
Probabilistic random walk after 2360 steps, saw 1410 distinct states, run finished after 12 ms. (steps per millisecond=196 ) properties seen :1
FORMULA FireWire-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Applied a total of 24 rules in 12 ms. Remains 116 /127 variables (removed 11) and now considering 313/342 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 116/127 places, 313/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 338
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 125 transition count 336
Applied a total of 6 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Applied a total of 30 rules in 16 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Applied a total of 30 rules in 16 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Applied a total of 18 rules in 8 ms. Remains 119 /127 variables (removed 8) and now considering 321/342 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 119/127 places, 321/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 338
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 125 transition count 336
Applied a total of 6 rules in 3 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Applied a total of 16 rules in 9 ms. Remains 120 /127 variables (removed 7) and now considering 323/342 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 120/127 places, 323/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Applied a total of 30 rules in 15 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:25:10] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:25:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:25:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 22:25:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 342 transitions and 1266 arcs took 3 ms.
Total runtime 93389 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-10

IS_COLORED=
IS_NUPN=

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


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

BK_STOP 1717367710758

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

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 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 ;