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.r550-tall-171734898900242.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 itstools
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 r550-tall-171734898900242
=====================================================================

--------------------
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 1717362117250

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 21:01:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:01:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:01:58] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 21:01:58] [INFO ] Transformed 131 places.
[2024-06-02 21:01:58] [INFO ] Transformed 409 transitions.
[2024-06-02 21:01:58] [INFO ] Found NUPN structural information;
[2024-06-02 21:01:58] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 172 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 34 ms. Remains 129 /131 variables (removed 2) and now considering 342/353 (removed 11) transitions.
[2024-06-02 21:01:58] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
// Phase 1: matrix 316 rows 129 cols
[2024-06-02 21:01:58] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 21:01:58] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-02 21:01:58] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
[2024-06-02 21:01:58] [INFO ] Invariant cache hit.
[2024-06-02 21:01:59] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:01:59] [INFO ] Implicit Places using invariants and state equation in 233 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 4 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 559 ms. Remains : 127/131 places, 342/353 transitions.
Support contains 77 out of 127 places after structural reductions.
[2024-06-02 21:01:59] [INFO ] Flatten gal took : 53 ms
[2024-06-02 21:01:59] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:01:59] [INFO ] Input system was already deterministic with 342 transitions.
RANDOM walk for 40000 steps (2191 resets) in 2129 ms. (18 steps per ms) remains 44/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (13 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (54 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (54 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (109 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (54 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (100 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (66 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 41/44 properties
BEST_FIRST walk for 4003 steps (102 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (67 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (122 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (64 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (68 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (60 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (62 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (62 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (107 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (101 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (157 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
[2024-06-02 21:02:00] [INFO ] Flow matrix only has 316 transitions (discarded 26 similar events)
// Phase 1: matrix 316 rows 127 cols
[2024-06-02 21:02:00] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 21:02:00] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/122 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 36 unsolved
[2024-06-02 21:02:01] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
[2024-06-02 21:02:01] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 36 unsolved
[2024-06-02 21:02:01] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 36 unsolved
[2024-06-02 21:02:01] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 315/437 variables, 122/132 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 44/176 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 5/442 variables, 5/181 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 1/443 variables, 1/182 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/443 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 182 constraints, problems are : Problem set: 4 solved, 36 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 73/122 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/10 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 315/437 variables, 122/132 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/176 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 32/208 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-06-02 21:02:03] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/209 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/209 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 5/442 variables, 5/214 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 2/216 constraints. Problems are: Problem set: 6 solved, 34 unsolved
[2024-06-02 21:02:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-02 21:02:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 2/218 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/218 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 1/443 variables, 1/219 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/219 constraints. Problems are: Problem set: 6 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 219 constraints, problems are : Problem set: 6 solved, 34 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 34/40 constraints, Known Traps: 7/7 constraints]
After SMT, in 7293ms problems are : Problem set: 6 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 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 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 125 transition count 338
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 125 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 125 transition count 335
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 125 transition count 335
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 19 place count 122 transition count 333
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 21 place count 122 transition count 331
Applied a total of 21 rules in 55 ms. Remains 122 /127 variables (removed 5) and now considering 331/342 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 122/127 places, 331/342 transitions.
RANDOM walk for 40000 steps (2216 resets) in 577 ms. (69 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (107 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (107 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (59 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 8 ms. (444 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (99 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (138 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (59 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (25 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (53 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (59 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (107 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (61 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (100 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
[2024-06-02 21:02:08] [INFO ] Flow matrix only has 306 transitions (discarded 25 similar events)
// Phase 1: matrix 306 rows 122 cols
[2024-06-02 21:02:08] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:02:08] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 77/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 21:02:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:02:08] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:02:08] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:02:08] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 306/423 variables, 117/127 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 5/428 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/428 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 178 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 77/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 21:02:09] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:02:09] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 306/423 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 46/175 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 28/203 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 21:02:10] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 5/428 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 21:02:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:02:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 213 constraints, problems are : Problem set: 0 solved, 30 unsolved in 6251 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 9/9 constraints]
After SMT, in 7558ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 7 properties in 3880 ms.
Support contains 32 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 331/331 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 122/122 places, 331/331 transitions.
RANDOM walk for 40000 steps (2174 resets) in 240 ms. (165 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (64 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (108 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (89 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (57 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (51 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (103 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (133 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (59 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (57 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (66 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (106 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (108 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 553452 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :14 out of 23
Probabilistic random walk after 553452 steps, saw 128372 distinct states, run finished after 3007 ms. (steps per millisecond=184 ) properties seen :14
[2024-06-02 21:02:22] [INFO ] Flow matrix only has 306 transitions (discarded 25 similar events)
[2024-06-02 21:02:22] [INFO ] Invariant cache hit.
[2024-06-02 21:02:22] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 78/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:02:23] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 24/117 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:02:23] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:02:23] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 306/423 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 5/428 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 177 constraints, problems are : Problem set: 0 solved, 9 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 78/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 24/117 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 306/423 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 5/428 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 186 constraints, problems are : Problem set: 0 solved, 9 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 1653ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 12663 ms.
Support contains 15 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 331/331 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 329
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 121 transition count 328
Applied a total of 3 rules in 17 ms. Remains 121 /122 variables (removed 1) and now considering 328/331 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 121/122 places, 328/331 transitions.
RANDOM walk for 40000 steps (2181 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1073 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (71 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (69 resets) in 33 ms. (1176 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (512 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (561 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (598 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1044 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1040 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
[2024-06-02 21:02:37] [INFO ] Flow matrix only has 303 transitions (discarded 25 similar events)
// Phase 1: matrix 303 rows 121 cols
[2024-06-02 21:02:37] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:02:37] [INFO ] State equation strengthened by 46 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) 80/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/116 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 303/419 variables, 116/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5/424 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 173 constraints, problems are : Problem set: 0 solved, 8 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 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) 80/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:02:37] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 24/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 303/419 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 46/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 5/424 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 184 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1345ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 18923 ms.
Support contains 12 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 328/328 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 119 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 118 transition count 325
Applied a total of 11 rules in 32 ms. Remains 118 /121 variables (removed 3) and now considering 325/328 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 118/121 places, 325/328 transitions.
RANDOM walk for 40000 steps (2337 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1105 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (61 resets) in 324 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (58 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (575 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (594 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (524 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1104 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1099 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 625155 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 8
Probabilistic random walk after 625155 steps, saw 135190 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2024-06-02 21:03:01] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
// Phase 1: matrix 296 rows 118 cols
[2024-06-02 21:03:01] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:03:01] [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 294 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 21:03:01] [INFO ] Deduced a trap composed of 40 places in 39 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
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (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 822 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 1133ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1167 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 6 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 6 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 21:03:03] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 21:03:03] [INFO ] Invariant cache hit.
[2024-06-02 21:03:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 21:03:03] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 21:03:03] [INFO ] Invariant cache hit.
[2024-06-02 21:03:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:03:03] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 21:03:03] [INFO ] Redundant transitions in 19 ms returned []
Running 323 sub problems to find dead transitions.
[2024-06-02 21:03:03] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 21:03:03] [INFO ] Invariant cache hit.
[2024-06-02 21:03:03] [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 21:03:04] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:03:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:03:05] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:03:05] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:03:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:03:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:03:05] [INFO ] Deduced a trap composed of 41 places in 62 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 21:03:06] [INFO ] Deduced a trap composed of 41 places in 62 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 21:03:09] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 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 15849 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 21:03:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:03:23] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 3 ms to minimize.
[2024-06-02 21:03:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 504 constraints, problems are : Problem set: 0 solved, 323 unsolved in 28053 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 44159ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 44165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44441 ms. Remains : 118/118 places, 325/325 transitions.
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 21:03:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 21:03:47] [INFO ] Flatten gal took : 19 ms
FORMULA FireWire-PT-10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:03:47] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:03:48] [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.
[2024-06-02 21:03:48] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 115 cols
[2024-06-02 21:03:48] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:03:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:03:48] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 21:03:48] [INFO ] Invariant cache hit.
[2024-06-02 21:03:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:03:48] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 21:03:48] [INFO ] Redundant transitions in 5 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 21:03:48] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 21:03:48] [INFO ] Invariant cache hit.
[2024-06-02 21:03:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 21:03:50] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:03:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:03:50] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:03:50] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 2 ms to minimize.
[2024-06-02 21:03:50] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/400 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 21:03:52] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:03:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 168 constraints, problems are : Problem set: 0 solved, 311 unsolved in 14085 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/400 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 311/478 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 21:04:07] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 1/401 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 480 constraints, problems are : Problem set: 0 solved, 311 unsolved in 26433 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
After SMT, in 40739ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 40743ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/127 places, 312/342 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41031 ms. Remains : 115/127 places, 312/342 transitions.
[2024-06-02 21:04:29] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:04:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:04:29] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 21:04:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:04:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16713708997952979423.gal : 6 ms
[2024-06-02 21:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14656233666505279670.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16713708997952979423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14656233666505279670.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50676e+06,6.29077,173888,2,7864,5,461815,6,0,771,594331,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p4==1)&&(p126==1))) + AG((((p14==1)&&(p27==1))||((p6==1)&&(p58==1))))) + ((p8==1)&&(p58==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p8==1)&&(p58==1)))) * !(E(TRUE U ((p4==1)&&(p126==1))))),TRUE) * !((((p14==1)&&(p...195
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...646
Detected timeout of ITS tools.
[2024-06-02 21:04:59] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:04:59] [INFO ] Applying decomposition
[2024-06-02 21:04:59] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5884793417295609268.txt' '-o' '/tmp/graph5884793417295609268.bin' '-w' '/tmp/graph5884793417295609268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5884793417295609268.bin' '-l' '-1' '-v' '-w' '/tmp/graph5884793417295609268.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:04:59] [INFO ] Decomposing Gal with order
[2024-06-02 21:04:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:04:59] [INFO ] Removed a total of 510 redundant transitions.
[2024-06-02 21:04:59] [INFO ] Flatten gal took : 53 ms
[2024-06-02 21:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 18 ms.
[2024-06-02 21:04:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15301076076216818912.gal : 5 ms
[2024-06-02 21:04:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7788409605339085413.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15301076076216818912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7788409605339085413.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50676e+06,29.2097,641344,2408,74,625098,1177,590,4.82901e+06,73,6175,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
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 17 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
[2024-06-02 21:05:29] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:05:29] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:05:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:05:29] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:05:29] [INFO ] Invariant cache hit.
[2024-06-02 21:05:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:05:29] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:05:29] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:05:29] [INFO ] Invariant cache hit.
[2024-06-02 21:05:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:05:32] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:05:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:06:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 39912ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 39916ms
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40162 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 21:06:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:09] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:06:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:06:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9463427898014809064.gal : 3 ms
[2024-06-02 21:06:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17749454137526247184.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9463427898014809064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17749454137526247184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,6.47528,184644,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: AX(EF(((A(!(((p8==1)&&(p112==1))) U AG(((p8==1)&&(p55==1)))) * (p103==0)) * ((p4==1)&&(p110==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!((E(!(!(E(TRUE U !(((p8==1)&&(p55==1)))))) U (!(!(((p8==1)&&(p112==1)))) * !(!(E(TRUE...281
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2024-06-02 21:06:39] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:39] [INFO ] Applying decomposition
[2024-06-02 21:06:39] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13137078653316896008.txt' '-o' '/tmp/graph13137078653316896008.bin' '-w' '/tmp/graph13137078653316896008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13137078653316896008.bin' '-l' '-1' '-v' '-w' '/tmp/graph13137078653316896008.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:06:39] [INFO ] Decomposing Gal with order
[2024-06-02 21:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:06:39] [INFO ] Removed a total of 480 redundant transitions.
[2024-06-02 21:06:39] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:06:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 9 ms.
[2024-06-02 21:06:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6430742902532139693.gal : 3 ms
[2024-06-02 21:06:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2623178157965641777.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6430742902532139693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2623178157965641777.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,3.54236,98064,2105,203,151327,1870,629,376605,86,12233,0


Converting to forward existential form...Done !
original formula: AX(EF(((A(!(((i3.u2.p8==1)&&(i5.u37.p112==1))) U AG(((i3.u2.p8==1)&&(i3.u19.p55==1)))) * (i5.u35.p103==0)) * ((i4.i1.u1.p4==1)&&(i5.u37.p...166
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!((E(!(!(E(TRUE U !(((i3.u2.p8==1)&&(i3.u19.p55==1)))))) U (!(!(((i3.u2.p8==1)&&(i5.u3...356
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t88, t89, t90, t91, t94, t137...767
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,18.423,400144,1,0,549146,5644,3113,1.87691e+06,369,37064,1376071
FORMULA FireWire-PT-10-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

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 20 ms. Remains 114 /127 variables (removed 13) and now considering 309/342 (removed 33) transitions.
[2024-06-02 21:06:58] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 114 cols
[2024-06-02 21:06:58] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:06:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:06:58] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 21:06:58] [INFO ] Invariant cache hit.
[2024-06-02 21:06:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:06:58] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 21:06:58] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 21:06:58] [INFO ] Invariant cache hit.
[2024-06-02 21:06:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:07:01] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 282/396 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 166 constraints, problems are : Problem set: 0 solved, 308 unsolved in 9808 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/396 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 308/473 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:07:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:07:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 1/397 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 21:07:24] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 477 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 9/9 constraints]
After SMT, in 39998ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 40034ms
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 309/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40298 ms. Remains : 114/127 places, 309/342 transitions.
[2024-06-02 21:07:38] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:07:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:07:38] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-02 21:07:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:07:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:07:38] [INFO ] Time to serialize gal into /tmp/CTLFireability693970665346670656.gal : 2 ms
[2024-06-02 21:07:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15874021855775621178.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability693970665346670656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15874021855775621178.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15961e+07,6.47063,184568,2,7271,5,489256,6,0,764,614686,0


Converting to forward existential form...Done !
original formula: AF((AX(EG(((p4==1)&&(p128==1)))) + ((AG(((p8==0)||(p115==0))) * AF((p58==0))) * AF(((p3==0)||(p42==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG(((p4==1)&&(p128==1)))))) + ((!(E(TRUE U !(((p8==0)||(p115==0))))) * !(EG(!((p58==0))))) ...199
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...645
Detected timeout of ITS tools.
[2024-06-02 21:08:08] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:08:08] [INFO ] Applying decomposition
[2024-06-02 21:08:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8385861817024457192.txt' '-o' '/tmp/graph8385861817024457192.bin' '-w' '/tmp/graph8385861817024457192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8385861817024457192.bin' '-l' '-1' '-v' '-w' '/tmp/graph8385861817024457192.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:08:08] [INFO ] Decomposing Gal with order
[2024-06-02 21:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:08:09] [INFO ] Removed a total of 488 redundant transitions.
[2024-06-02 21:08:09] [INFO ] Flatten gal took : 29 ms
[2024-06-02 21:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 6 ms.
[2024-06-02 21:08:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10152543426521716913.gal : 20 ms
[2024-06-02 21:08:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18231900050891073477.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10152543426521716913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18231900050891073477.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15961e+07,4.18455,140016,2764,101,224157,1124,614,626231,79,5383,0


Converting to forward existential form...Done !
original formula: AF((AX(EG(((i1.i2.u1.p4==1)&&(i1.i0.u3.p128==1)))) + ((AG(((i2.u2.p8==0)||(i5.i1.u39.p115==0))) * AF((i4.u20.p58==0))) * AF(((i0.u0.p3==0...181
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG(((i1.i2.u1.p4==1)&&(i1.i0.u3.p128==1)))))) + ((!(E(TRUE U !(((i2.u2.p8==0)||(i5.i1.u39.p...256
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t45, t46, t48, t56, t61, t66, t71, t76, t83, t91, t96, t133, t134, t135, t137, ...797
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
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 23 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
[2024-06-02 21:08:39] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:08:39] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:08:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:08:39] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:08:39] [INFO ] Invariant cache hit.
[2024-06-02 21:08:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:08:39] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:08:39] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:08:39] [INFO ] Invariant cache hit.
[2024-06-02 21:08:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:08:41] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:08:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:08:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:08:41] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:08:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9867 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:08:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:08:59] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:09:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 40048ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 40051ms
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40312 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 21:09:19] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:09:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:09:19] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:09:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:09:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9938304149884222944.gal : 2 ms
[2024-06-02 21:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13936323621241683510.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9938304149884222944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13936323621241683510.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,6.52685,184696,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: AX(EX((A(((p9==1)&&(p21==1)) U ((p9==1)&&(p60==1))) + EF(((p8==1)&&(p103==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!((E(!(((p9==1)&&(p60==1))) U (!(((p9==1)&&(p21==1))) * !(((p9==1)&&(p60==1))))) + EG(!(((p9=...219
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2024-06-02 21:09:49] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:09:49] [INFO ] Applying decomposition
[2024-06-02 21:09:49] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14760832193855106488.txt' '-o' '/tmp/graph14760832193855106488.bin' '-w' '/tmp/graph14760832193855106488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14760832193855106488.bin' '-l' '-1' '-v' '-w' '/tmp/graph14760832193855106488.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:09:49] [INFO ] Decomposing Gal with order
[2024-06-02 21:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:09:49] [INFO ] Removed a total of 480 redundant transitions.
[2024-06-02 21:09:49] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 5 ms.
[2024-06-02 21:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability618151131904621492.gal : 1 ms
[2024-06-02 21:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14990656956066058341.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability618151131904621492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14990656956066058341.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,7.49913,217612,2599,161,344830,1444,601,972745,86,9527,0


Converting to forward existential form...Done !
original formula: AX(EX((A(((i0.i0.u3.p9==1)&&(i1.u7.p21==1)) U ((i0.i0.u3.p9==1)&&(i4.u21.p60==1))) + EF(((i4.u2.p8==1)&&(i6.u35.p103==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!((E(!(((i0.i0.u3.p9==1)&&(i4.u21.p60==1))) U (!(((i0.i0.u3.p9==1)&&(i1.u7.p21==1))) * !(((i0...295
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t45, t46, t47, t56, t61, t66, t71, t76, t79, t91, t96, t133, t134, t135, t137, ...785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,19.1665,440944,1,0,712111,4581,3080,1.67797e+06,368,24893,1640897
FORMULA FireWire-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

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 1 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
[2024-06-02 21:10:08] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2024-06-02 21:10:08] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:10:08] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 21:10:08] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:10:08] [INFO ] Invariant cache hit.
[2024-06-02 21:10:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:10:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-02 21:10:09] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:10:09] [INFO ] Invariant cache hit.
[2024-06-02 21:10:09] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 181 constraints, problems are : Problem set: 0 solved, 335 unsolved in 14051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/515 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:10:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:10:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 1/435 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:10:45] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 519 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 8/8 constraints]
After SMT, in 44289ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44293ms
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 336/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44513 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 21:10:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:10:53] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:10:53] [INFO ] Input system was already deterministic with 336 transitions.
[2024-06-02 21:10:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:10:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:10:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4017827702085358667.gal : 2 ms
[2024-06-02 21:10:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18153499281166148586.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4017827702085358667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18153499281166148586.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,1.99612,68456,2,2820,5,202226,6,0,835,209509,0


Converting to forward existential form...Done !
original formula: EF((EX(EF(((p8==1)&&(p32==1)))) * !(E(EF(((p9==1)&&(p109==1))) U ((p9==1)&&(p79==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(E(TRUE U ((p8==1)&&(p32==1))))) * !(E(E(TRUE U ((p9==1)&&(p109==1))) U ((p9==1)&&(p79==1...170
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
(forward)formula 0,1,28.31,741720,1,0,1157,3.57359e+06,695,732,7100,2.65817e+06,1298
FORMULA FireWire-PT-10-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
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 34 ms. Remains 111 /127 variables (removed 16) and now considering 305/342 (removed 37) transitions.
[2024-06-02 21:11:22] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 111 cols
[2024-06-02 21:11:22] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:11:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 21:11:22] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:11:22] [INFO ] Invariant cache hit.
[2024-06-02 21:11:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:11:22] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 21:11:22] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 21:11:22] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:11:22] [INFO ] Invariant cache hit.
[2024-06-02 21:11:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/390 variables, and 163 constraints, problems are : Problem set: 0 solved, 302 unsolved in 17082 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 302/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:11:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/390 variables, and 467 constraints, problems are : Problem set: 0 solved, 302 unsolved in 26035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 10/10 constraints]
After SMT, in 43269ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43273ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/127 places, 305/342 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43580 ms. Remains : 111/127 places, 305/342 transitions.
[2024-06-02 21:12:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:12:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:12:05] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 21:12:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10992598300794259686.gal : 2 ms
[2024-06-02 21:12:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17454718747587722168.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10992598300794259686.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17454718747587722168.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2328 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (21 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality17454718747587722168.prop.
Finished probabilistic random walk after 2360 steps, run visited all 1 properties in 7 ms. (steps per millisecond=337 )
Probabilistic random walk after 2360 steps, saw 1410 distinct states, run finished after 30 ms. (steps per millisecond=78 ) properties seen :1
FORMULA FireWire-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 11 ms. Remains 116 /127 variables (removed 11) and now considering 313/342 (removed 29) transitions.
[2024-06-02 21:12:05] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
// Phase 1: matrix 287 rows 116 cols
[2024-06-02 21:12:05] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:12:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:12:05] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 21:12:05] [INFO ] Invariant cache hit.
[2024-06-02 21:12:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:12:06] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-02 21:12:06] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 21:12:06] [INFO ] Invariant cache hit.
[2024-06-02 21:12:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 21:12:07] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:12:07] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:12:07] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:12:07] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:12:07] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:12:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/402 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 168 constraints, problems are : Problem set: 0 solved, 312 unsolved in 11947 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/402 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 312/479 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 21:12:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/403 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 21:12:47] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 483 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 9/9 constraints]
After SMT, in 42129ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 42133ms
Starting structural reductions in LTL mode, iteration 1 : 116/127 places, 313/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42367 ms. Remains : 116/127 places, 313/342 transitions.
[2024-06-02 21:12:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:48] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-02 21:12:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6276706262821841102.gal : 1 ms
[2024-06-02 21:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7234055699946925994.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6276706262821841102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7234055699946925994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16372e+07,1.24965,43472,2,2938,5,109398,6,0,776,115272,0


Converting to forward existential form...Done !
original formula: (AX(AF(!(E(((p4==1)&&(p88==1)) U (((p7==1)&&(p104==1))||((p3==1)&&(p77==1))))))) * !(E(((p9==1)&&(p45==1)) U ((p9==1)&&(p17==1)))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(E(((p4==1)&&(p88==1)) U (((p7==1)&&(p104==1))||((p3==1)&&(p77==1)))))))] = FALSE * [(FwdU(In...211
Hit Full ! (commute/partial/dont) 255/55/58
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...652
(forward)formula 0,1,2.59072,60580,1,0,560,258691,657,288,6568,258271,642
FORMULA FireWire-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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 5 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
[2024-06-02 21:12:50] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2024-06-02 21:12:50] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 21:12:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:12:50] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:12:50] [INFO ] Invariant cache hit.
[2024-06-02 21:12:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:12:51] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-02 21:12:51] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:12:51] [INFO ] Invariant cache hit.
[2024-06-02 21:12:51] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:12:52] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:12:52] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 181 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13636 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/515 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:13:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:13:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 1/435 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:13:27] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 519 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 8/8 constraints]
After SMT, in 43869ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43873ms
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 336/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44127 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 21:13:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:13:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:13:34] [INFO ] Input system was already deterministic with 336 transitions.
[2024-06-02 21:13:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:13:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:13:35] [INFO ] Time to serialize gal into /tmp/CTLFireability166349255915530349.gal : 3 ms
[2024-06-02 21:13:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18077623761884150303.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability166349255915530349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18077623761884150303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,2.00241,68444,2,2820,5,202226,6,0,835,209509,0


Converting to forward existential form...Done !
original formula: A(AX(!(((EX((p73==1)) + E(((p8==1)&&(p32==1)) U ((p5==1)&&(p37==1)))) + ((((p8==1)&&(p37==1))&&((p8==1)&&(p59==1)))||(((((p31==1)||((p6==...307
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((((!((p8==1)&&(p28==1)))&&(p4==1))&&(p84==1))) U !(E(TRUE U !(EX(!(((p40==1)&&(p53==1))))))...596
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,21.1633,556240,1,0,828,2.93548e+06,711,451,7289,2.36483e+06,929
FORMULA FireWire-PT-10-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
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.
[2024-06-02 21:13:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:13:56] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 21:13:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:13:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:13:56] [INFO ] Invariant cache hit.
[2024-06-02 21:13:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:13:56] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:13:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:13:56] [INFO ] Invariant cache hit.
[2024-06-02 21:13:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 40039ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 40043ms
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40304 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 21:14:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:14:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:14:36] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:14:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:14:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10981098656987782772.gal : 2 ms
[2024-06-02 21:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9800123803954210983.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10981098656987782772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9800123803954210983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,6.70726,184472,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: EX(((p8==1)&&(p130==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p8==1)&&(p130==1)))] != FALSE
(forward)formula 0,0,6.71604,184472,1,0,8,477294,8,1,1165,637251,2
FORMULA FireWire-PT-10-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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 17 ms. Remains 113 /127 variables (removed 14) and now considering 307/342 (removed 35) transitions.
[2024-06-02 21:14:43] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:14:43] [INFO ] Invariant cache hit.
[2024-06-02 21:14:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 21:14:43] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:14:43] [INFO ] Invariant cache hit.
[2024-06-02 21:14:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:14:43] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:14:43] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:14:43] [INFO ] Invariant cache hit.
[2024-06-02 21:14:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:45] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:14:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:14:45] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:14:45] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:46] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9900 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:14:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:15:03] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:15:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 40068ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 40072ms
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40295 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 21:15:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:15:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:15:23] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:15:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:15:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:15:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7763538793918824515.gal : 1 ms
[2024-06-02 21:15:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11410133813217996224.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7763538793918824515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11410133813217996224.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,6.74994,184516,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: EF(EX(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * TRUE)] != FALSE
(forward)formula 0,1,6.94152,184516,1,0,6,477294,7,1,1414,637251,2
FORMULA FireWire-PT-10-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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 12 ms. Remains 119 /127 variables (removed 8) and now considering 321/342 (removed 21) transitions.
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 119 cols
[2024-06-02 21:15:30] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:15:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:15:30] [INFO ] Invariant cache hit.
[2024-06-02 21:15:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:15:30] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:15:30] [INFO ] Invariant cache hit.
[2024-06-02 21:15:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:15:32] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:15:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:15:32] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:15:32] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:15:32] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/414 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 172 constraints, problems are : Problem set: 0 solved, 320 unsolved in 12168 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 320/491 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:15:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:15:53] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:15:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-06-02 21:15:54] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 1/414 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 496 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 9/9 constraints]
After SMT, in 42356ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 42360ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 321/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42604 ms. Remains : 119/127 places, 321/342 transitions.
[2024-06-02 21:16:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:13] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 21:16:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:16:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:16:13] [INFO ] Time to serialize gal into /tmp/CTLFireability18261668746905925515.gal : 2 ms
[2024-06-02 21:16:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4489366646644238502.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18261668746905925515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4489366646644238502.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16984e+07,7.3092,204184,2,9074,5,538341,6,0,796,694155,0


Converting to forward existential form...Done !
original formula: EX((AG(((AF(((p8==0)||(p37==0))) + ((p7==1)&&(p114==1))) + ((p3==1)&&(p123==1)))) + AG(((p57==1) + EX((((p3==1)&&(p93==1))||((p3==1)&&(p4...167
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((!(EG(!(((p8==0)||(p37==0))))) + ((p7==1)&&(p114==1))) + ((p3==1)&&(p123==1)))))))] ...266
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...675
Detected timeout of ITS tools.
[2024-06-02 21:16:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:16:43] [INFO ] Applying decomposition
[2024-06-02 21:16:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14477949930654399018.txt' '-o' '/tmp/graph14477949930654399018.bin' '-w' '/tmp/graph14477949930654399018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14477949930654399018.bin' '-l' '-1' '-v' '-w' '/tmp/graph14477949930654399018.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:16:43] [INFO ] Decomposing Gal with order
[2024-06-02 21:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:16:43] [INFO ] Removed a total of 510 redundant transitions.
[2024-06-02 21:16:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:16:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 6 ms.
[2024-06-02 21:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4854760367324642858.gal : 2 ms
[2024-06-02 21:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11030529695456535230.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4854760367324642858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11030529695456535230.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16984e+07,14.6515,317988,2791,140,391844,1447,657,1.71538e+06,83,10895,0


Converting to forward existential form...Done !
original formula: EX((AG(((AF(((i4.u2.p8==0)||(i2.u11.p37==0))) + ((i4.u2.p7==1)&&(i5.i1.u39.p114==1))) + ((i0.u0.p3==1)&&(i0.u29.p123==1)))) + AG(((i4.u21...248
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((!(EG(!(((i4.u2.p8==0)||(i2.u11.p37==0))))) + ((i4.u2.p7==1)&&(i5.i1.u39.p114==1))) ...347
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t91, t94, t133, t134, t135, t137, ...807
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,19.3678,317988,1,0,391844,3316,3367,1.71538e+06,351,14529,735842
FORMULA FireWire-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

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 1 ms. Remains 125 /127 variables (removed 2) and now considering 336/342 (removed 6) transitions.
[2024-06-02 21:17:02] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2024-06-02 21:17:02] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 21:17:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:17:03] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:17:03] [INFO ] Invariant cache hit.
[2024-06-02 21:17:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:17:03] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-02 21:17:03] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:17:03] [INFO ] Invariant cache hit.
[2024-06-02 21:17:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:17:04] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:17:05] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:17:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:17:05] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:17:05] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 181 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13666 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/515 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:17:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:17:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 1/435 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 21:17:39] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 519 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 8/8 constraints]
After SMT, in 43866ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43870ms
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 336/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44086 ms. Remains : 125/127 places, 336/342 transitions.
[2024-06-02 21:17:47] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:17:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:17:47] [INFO ] Input system was already deterministic with 336 transitions.
[2024-06-02 21:17:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:17:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:17:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6140047637279867557.gal : 2 ms
[2024-06-02 21:17:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4669943195493786911.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6140047637279867557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4669943195493786911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,2.10427,68316,2,2820,5,202226,6,0,835,209509,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * A(((E(AX(!(((p10==1)&&(p86==1)))) U EF((((p8==1)&&(p29==1))||((p7==1)&&(p30==1))))) * A(AG(((p8==1)&&(p114==1))) U !(((p8==1...362
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((p6==1)&&(p38==1))) * !((!(E(TRUE U !(((p9==1)&...2187
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 21:18:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:18:17] [INFO ] Applying decomposition
[2024-06-02 21:18:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17170075631172646682.txt' '-o' '/tmp/graph17170075631172646682.bin' '-w' '/tmp/graph17170075631172646682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17170075631172646682.bin' '-l' '-1' '-v' '-w' '/tmp/graph17170075631172646682.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:18:17] [INFO ] Decomposing Gal with order
[2024-06-02 21:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:18:17] [INFO ] Removed a total of 537 redundant transitions.
[2024-06-02 21:18:17] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:18:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 4 ms.
[2024-06-02 21:18:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14740518567829442379.gal : 2 ms
[2024-06-02 21:18:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12640061546039074313.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14740518567829442379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12640061546039074313.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,6.45207,185060,2515,218,223180,7902,709,1.11091e+06,87,68422,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * A(((E(AX(!(((i2.i0.u3.p10==1)&&(i4.u30.p86==1)))) U EF((((i1.u2.p8==1)&&(i1.u10.p29==1))||((i1.u2.p7==1)&&(i1.u10.p30==1))))...541
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((i5.i1.u37.p6==1)&&(i1.u11.p38==1))) * !((!(E(T...3086
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t60, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94,...874
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
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 13 ms. Remains 120 /127 variables (removed 7) and now considering 323/342 (removed 19) transitions.
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 21:18:47] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:18:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:18:47] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 173 constraints, problems are : Problem set: 0 solved, 322 unsolved in 12807 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 322/494 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 21:19:12] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 11 (OVERLAPS) 0/417 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 496 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 6/6 constraints]
After SMT, in 43009ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 43012ms
Starting structural reductions in LTL mode, iteration 1 : 120/127 places, 323/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43275 ms. Remains : 120/127 places, 323/342 transitions.
[2024-06-02 21:19:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:19:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:19:30] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 21:19:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:19:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16832333481654711575.gal : 1 ms
[2024-06-02 21:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16543078155755444556.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16832333481654711575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16543078155755444556.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17193e+07,1.27646,43020,2,2860,5,109317,6,0,802,113510,0


Converting to forward existential form...Done !
original formula: (EG(((p31==1) + E(!(A((p105==1) U (p105==1))) U A(!(((p10==1)&&(p84==1))) U (((p72==1)&&(p130==1))&&((p8==1)&&(p37==1))))))) + (EG(((p5==...233
=> equivalent forward existential formula: ([FwdG(Init,((p31==1) + E(!(!((E(!((p105==1)) U (!((p105==1)) * !((p105==1)))) + EG(!((p105==1)))))) U !((E(!(((...570
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...676
Detected timeout of ITS tools.
[2024-06-02 21:20:00] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:20:00] [INFO ] Applying decomposition
[2024-06-02 21:20:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10638951669654759261.txt' '-o' '/tmp/graph10638951669654759261.bin' '-w' '/tmp/graph10638951669654759261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10638951669654759261.bin' '-l' '-1' '-v' '-w' '/tmp/graph10638951669654759261.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:20:00] [INFO ] Decomposing Gal with order
[2024-06-02 21:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:20:00] [INFO ] Removed a total of 512 redundant transitions.
[2024-06-02 21:20:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:20:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 3 ms.
[2024-06-02 21:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11633441094293844764.gal : 2 ms
[2024-06-02 21:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13573490594999310130.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11633441094293844764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13573490594999310130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17193e+07,5.03241,139316,2015,170,234100,1535,632,481347,86,11480,0


Converting to forward existential form...Done !
original formula: (EG(((i3.u12.p31==1) + E(!(A((i7.i0.u37.p105==1) U (i7.i0.u37.p105==1))) U A(!(((i1.u3.p10==1)&&(i0.u29.p84==1))) U (((i6.u23.p72==1)&&(i...347
=> equivalent forward existential formula: ([FwdG(Init,((i3.u12.p31==1) + E(!(!((E(!((i7.i0.u37.p105==1)) U (!((i7.i0.u37.p105==1)) * !((i7.i0.u37.p105==1)...788
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t67, t71, t76, t80, t91, t94, t96, t133, t13...800
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
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.
[2024-06-02 21:20:30] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:20:30] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:20:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:20:30] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:20:30] [INFO ] Invariant cache hit.
[2024-06-02 21:20:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:20:31] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:20:31] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:20:31] [INFO ] Invariant cache hit.
[2024-06-02 21:20:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:20:33] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9924 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:20:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:21:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 40094ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 40098ms
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40331 ms. Remains : 113/127 places, 307/342 transitions.
[2024-06-02 21:21:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:21:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:21:11] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:21:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:21:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3718194792477039275.gal : 1 ms
[2024-06-02 21:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4881169885955109894.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3718194792477039275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4881169885955109894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,6.78703,184468,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,6.79481,184468,1,0,6,477294,7,1,1161,637251,1
FORMULA FireWire-PT-10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 21:21:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:21:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:21:18] [INFO ] Applying decomposition
[2024-06-02 21:21:18] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2010460922493840463.txt' '-o' '/tmp/graph2010460922493840463.bin' '-w' '/tmp/graph2010460922493840463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2010460922493840463.bin' '-l' '-1' '-v' '-w' '/tmp/graph2010460922493840463.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:21:18] [INFO ] Decomposing Gal with order
[2024-06-02 21:21:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:21:18] [INFO ] Removed a total of 549 redundant transitions.
[2024-06-02 21:21:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 3 ms.
[2024-06-02 21:21:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7535022313449873460.gal : 2 ms
[2024-06-02 21:21:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13549812668541482503.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7535022313449873460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13549812668541482503.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23038e+07,2.40912,77300,1916,112,95054,1456,655,443963,91,8021,0


Converting to forward existential form...Done !
original formula: AG(((EF(((i0.i0.u1.p4==1)&&(i0.i0.u42.p126==1))) + AG((((i0.i0.u5.p14==1)&&(i1.u9.p27==1))||((i6.u4.p6==1)&&(i2.u21.p58==1))))) + ((i2.u2...182
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((i2.u2.p8==1)&&(i2.u21.p58==1)))) * !(E(TRUE U ((i0.i0.u1.p4==1)&&(i0.i0.u42.p126=...255
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t42, t45, t46, t56, t61, t65, t66, t71, t76, t91, t94, t96, t135, t136, t137, t139, ...870
(forward)formula 0,0,7.17641,149900,1,0,173608,2188,3696,953595,405,8538,472024
FORMULA FireWire-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((AX(EG(((i0.i0.u1.p4==1)&&(i0.i0.u42.p128==1)))) + ((AG(((i2.u2.p8==0)||(i5.i1.u37.p115==0))) * AF((i2.u21.p58==0))) * AF(((i4.u0.p3==...182
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG(((i0.i0.u1.p4==1)&&(i0.i0.u42.p128==1)))))) + ((!(E(TRUE U !(((i2.u2.p8==0)||(i5.i1.u37....257
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,0,45.7336,844892,1,0,1.19831e+06,2652,3882,4.03231e+06,420,12184,2318333
FORMULA FireWire-PT-10-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AX(FALSE) * A(((E(AX(!(((i3.i0.u3.p10==1)&&(i4.u27.p86==1)))) U EF((((i2.u2.p8==1)&&(i1.u10.p29==1))||((i2.u2.p7==1)&&(i1.u10.p30==1))))...523
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((i6.u4.p6==1)&&(i1.u11.p38==1))) * !((!(E(TRUE ...2972
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 2,0,99.8886,1653264,1,0,2.37399e+06,3126,4008,6.87655e+06,425,14932,4708923
FORMULA FireWire-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EG(((i1.u11.p31==1) + E(!(A((i6.u43.p105==1) U (i6.u43.p105==1))) U A(!(((i3.i0.u3.p10==1)&&(i4.u26.p84==1))) U (((i5.i0.u24.p72==1)&&(i...341
=> equivalent forward existential formula: ([FwdG(Init,((i1.u11.p31==1) + E(!(!((E(!((i6.u43.p105==1)) U (!((i6.u43.p105==1)) * !((i6.u43.p105==1)))) + EG(...776
(forward)formula 3,1,149.846,2204496,1,0,3.27428e+06,3682,1554,8.68363e+06,209,17743,1065494
FORMULA FireWire-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Total runtime 1309870 ms.

BK_STOP 1717363428292

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r550-tall-171734898900242"
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 ;