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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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-08-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360935145

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:42:16] [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 20:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:42:16] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 20:42:16] [INFO ] Transformed 127 places.
[2024-06-02 20:42:16] [INFO ] Transformed 397 transitions.
[2024-06-02 20:42:16] [INFO ] Found NUPN structural information;
[2024-06-02 20:42:16] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 76 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 127 transition count 338
Applied a total of 6 rules in 23 ms. Remains 127 /127 variables (removed 0) and now considering 338/344 (removed 6) transitions.
[2024-06-02 20:42:16] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 20:42:16] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:42:16] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-02 20:42:16] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 20:42:16] [INFO ] Invariant cache hit.
[2024-06-02 20:42:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:42:17] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2024-06-02 20:42:17] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 20:42:17] [INFO ] Invariant cache hit.
[2024-06-02 20:42:17] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 20:42:20] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 9 ms to minimize.
[2024-06-02 20:42:20] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:42:20] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 10 ms to minimize.
[2024-06-02 20:42:22] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2024-06-02 20:42:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-06-02 20:42:22] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/271 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 1/439 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (OVERLAPS) 0/439 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 316 constraints, problems are : Problem set: 0 solved, 337 unsolved in 15465 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/271 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 337/652 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 653 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30022 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 9/9 constraints]
After SMT, in 45939ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 45962ms
Starting structural reductions in LTL mode, iteration 1 : 127/127 places, 338/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46622 ms. Remains : 127/127 places, 338/344 transitions.
Support contains 76 out of 127 places after structural reductions.
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 51 ms
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:43:03] [INFO ] Input system was already deterministic with 338 transitions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (2150 resets) in 2140 ms. (18 steps per ms) remains 41/77 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (108 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (58 resets) in 29 ms. (133 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 4002 steps (100 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (61 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (126 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (54 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (62 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (60 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (56 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (56 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (69 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (101 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 35/41 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (55 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (58 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (66 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (101 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (61 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (60 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (152 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (68 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
[2024-06-02 20:43:04] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 20:43:04] [INFO ] Invariant cache hit.
[2024-06-02 20:43:04] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 2 (OVERLAPS) 67/115 variables, 5/53 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 67/120 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 9/124 variables, 3/123 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 9/132 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-06-02 20:43:05] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/133 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/133 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 311/435 variables, 124/257 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 44/301 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/301 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/304 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 3/307 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/307 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 1/439 variables, 1/308 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/308 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/439 variables, 0/308 constraints. Problems are: Problem set: 5 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 308 constraints, problems are : Problem set: 5 solved, 30 unsolved in 2757 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 75/115 variables, 5/45 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 75/120 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-06-02 20:43:07] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:43:07] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:43:07] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/123 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/123 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 9/124 variables, 3/126 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 9/135 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/136 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-06-02 20:43:08] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:43:08] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/138 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 311/435 variables, 124/262 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 44/306 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 29/335 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/335 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 3/438 variables, 3/338 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 3/341 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 1/342 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-06-02 20:43:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/343 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/343 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 20 (OVERLAPS) 1/439 variables, 1/344 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/439 variables, 0/344 constraints. Problems are: Problem set: 5 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 344 constraints, problems are : Problem set: 5 solved, 30 unsolved in 5007 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 30/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 7862ms problems are : Problem set: 5 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 338/338 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 335
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 124 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 124 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 123 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 123 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 122 transition count 324
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 120 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 120 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 120 transition count 322
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 120 transition count 324
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 119 transition count 322
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 30 place count 119 transition count 320
Applied a total of 30 rules in 88 ms. Remains 119 /127 variables (removed 8) and now considering 320/338 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 119/127 places, 320/338 transitions.
RANDOM walk for 40000 steps (2195 resets) in 624 ms. (64 steps per ms) remains 26/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (108 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (106 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (66 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (129 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (61 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (62 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (67 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (13 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (108 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (60 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (58 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (56 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (55 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (73 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (67 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
[2024-06-02 20:43:12] [INFO ] Flow matrix only has 293 transitions (discarded 27 similar events)
// Phase 1: matrix 293 rows 119 cols
[2024-06-02 20:43:12] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:43:12] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 71/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 293/409 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 3/412 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 172 constraints, problems are : Problem set: 0 solved, 26 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 71/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 8/116 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:43:14] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 293/409 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 25/200 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 3/412 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 20:43:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/412 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 205 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3141 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 7/7 constraints]
After SMT, in 4024ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 8 properties in 3044 ms.
Support contains 26 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 320/320 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 315
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 315
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 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 115 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 115 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 115 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 114 transition count 310
Applied a total of 13 rules in 44 ms. Remains 114 /119 variables (removed 5) and now considering 310/320 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 114/119 places, 310/320 transitions.
RANDOM walk for 40000 steps (2280 resets) in 246 ms. (161 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (112 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (103 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (63 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (134 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (64 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (115 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (64 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (41 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (63 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 541175 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :13 out of 18
Probabilistic random walk after 541175 steps, saw 124324 distinct states, run finished after 3008 ms. (steps per millisecond=179 ) properties seen :13
[2024-06-02 20:43:23] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 20:43:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:43:23] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 227/289 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 96/385 variables, 44/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 21/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/395 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 165 constraints, problems are : Problem set: 0 solved, 5 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 227/289 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 96/385 variables, 44/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 21/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/386 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/395 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/395 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 170 constraints, problems are : Problem set: 0 solved, 5 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2786 ms.
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 310/310 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 305
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 112 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 111 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 111 transition count 302
Applied a total of 7 rules in 24 ms. Remains 111 /114 variables (removed 3) and now considering 302/310 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 111/114 places, 302/310 transitions.
RANDOM walk for 40000 steps (2351 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1123 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (568 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (576 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (517 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (72 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 658803 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 5
Probabilistic random walk after 658803 steps, saw 148307 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2024-06-02 20:43:30] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 20:43:30] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:43:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 220/281 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 93/374 variables, 42/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/384 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/384 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 161 constraints, problems are : Problem set: 0 solved, 5 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 220/281 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 93/374 variables, 42/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/375 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/384 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/384 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 166 constraints, problems are : Problem set: 0 solved, 5 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1875 ms.
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 111/111 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 20:43:33] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:43:33] [INFO ] Invariant cache hit.
[2024-06-02 20:43:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:43:33] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:43:33] [INFO ] Invariant cache hit.
[2024-06-02 20:43:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:43:33] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 20:43:33] [INFO ] Redundant transitions in 16 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 20:43:33] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:43:33] [INFO ] Invariant cache hit.
[2024-06-02 20:43:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:43:34] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:43:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:43:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 20:43:38] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:43:38] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 174 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14310 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/131 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 300/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
After SMT, in 33721ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 33725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34080 ms. Remains : 111/111 places, 302/302 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 172
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 85 transition count 167
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 13 place count 82 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 82 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 82 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 81 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 81 transition count 164
Applied a total of 19 rules in 27 ms. Remains 81 /111 variables (removed 30) and now considering 164/302 (removed 138) transitions.
Running SMT prover for 5 properties.
[2024-06-02 20:44:07] [INFO ] Flow matrix only has 162 transitions (discarded 2 similar events)
// Phase 1: matrix 162 rows 81 cols
[2024-06-02 20:44:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:44:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:44:07] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:44:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:44:07] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 20:44:07] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 20:44:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:44:07] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-02 20:44:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
TRAPS : Iteration 1
[2024-06-02 20:44:07] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 20:44:07] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 587 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:44:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:44:07] [INFO ] Flatten gal took : 24 ms
FORMULA FireWire-PT-08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:44:07] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:44:07] [INFO ] Input system was already deterministic with 338 transitions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 123 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 121 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 121 transition count 322
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 16 place count 120 transition count 321
Applied a total of 16 rules in 19 ms. Remains 120 /127 variables (removed 7) and now considering 321/338 (removed 17) transitions.
[2024-06-02 20:44:07] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 20:44:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:44:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:44:08] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 20:44:08] [INFO ] Invariant cache hit.
[2024-06-02 20:44:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:44:08] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:44:08] [INFO ] Redundant transitions in 6 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-02 20:44:08] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 20:44:08] [INFO ] Invariant cache hit.
[2024-06-02 20:44:08] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:44:09] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:44:09] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:44:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/414 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 182 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/414 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 320/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 1/415 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 0/415 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 502 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 11/11 constraints]
After SMT, in 43989ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 43993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/127 places, 321/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44271 ms. Remains : 120/127 places, 321/338 transitions.
[2024-06-02 20:44:52] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:44:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:44:52] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 20:44:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:44:52] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13426638615627839485.gal : 7 ms
[2024-06-02 20:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10471616058483122613.ctl : 3 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/CTLFireability13426638615627839485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10471616058483122613.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.00815e+07,0.935601,32092,2,2355,5,98863,6,0,800,104806,0


Converting to forward existential form...Done !
original formula: AF(AG(((!(A(((p14==1)&&(p25==1)) U (p112==1))) * ((p8==0)||(p100==0))) * ((((p7==0)||(p26==0))||((p10==0)||(p44==0)))||((p11==0)||(p15==0...161
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(!((E(!((p112==1)) U (!(((p14==1)&&(p25==1))) * !((p112==1)))) + EG(!((p112==1)))))...265
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...691
Detected timeout of ITS tools.
[2024-06-02 20:45:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:45:22] [INFO ] Applying decomposition
[2024-06-02 20:45:22] [INFO ] Flatten gal took : 12 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/graph6806291097634736217.txt' '-o' '/tmp/graph6806291097634736217.bin' '-w' '/tmp/graph6806291097634736217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6806291097634736217.bin' '-l' '-1' '-v' '-w' '/tmp/graph6806291097634736217.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:45:22] [INFO ] Decomposing Gal with order
[2024-06-02 20:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:45:22] [INFO ] Removed a total of 503 redundant transitions.
[2024-06-02 20:45:22] [INFO ] Flatten gal took : 57 ms
[2024-06-02 20:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 13 ms.
[2024-06-02 20:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14225567805843999825.gal : 6 ms
[2024-06-02 20:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16310150072122374034.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/CTLFireability14225567805843999825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16310150072122374034.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.00815e+07,1.59099,51120,1100,188,75786,1383,660,192819,89,10523,0


Converting to forward existential form...Done !
original formula: AF(AG(((!(A(((i1.u4.p14==1)&&(i2.u8.p25==1)) U (i6.i1.u39.p112==1))) * ((i3.u2.p8==0)||(i5.u34.p100==0))) * ((((i3.u2.p7==0)||(i2.u8.p26=...242
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(!((E(!((i6.i1.u39.p112==1)) U (!(((i1.u4.p14==1)&&(i2.u8.p25==1))) * !((i6.i1.u39....366
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t52, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, t100, t1...847
Using saturation style SCC detection
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 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
(forward)formula 0,0,28.7194,584656,1,0,839589,5091,3388,2.40756e+06,396,35702,1741121
FORMULA FireWire-PT-08-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 4 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2024-06-02 20:45:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 20:45:51] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:45:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:45:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:45:51] [INFO ] Invariant cache hit.
[2024-06-02 20:45:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:45:51] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 20:45:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:45:51] [INFO ] Invariant cache hit.
[2024-06-02 20:45:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:45:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:45:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 178 constraints, problems are : Problem set: 0 solved, 316 unsolved in 12894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 494 constraints, problems are : Problem set: 0 solved, 316 unsolved in 27627 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
After SMT, in 40706ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 40709ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40958 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:46:32] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15163206966705642811.gal : 3 ms
[2024-06-02 20:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4064749383370378899.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/CTLFireability15163206966705642811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4064749383370378899.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.16095e+07,0.52745,21060,2,2300,5,63821,6,0,792,56410,0


Converting to forward existential form...Done !
original formula: EF((((p6==1)&&(p109==1)) + (EG(((A(((p10==1)&&(p88==1)) U ((p3==1)&&(p113==1))) * AF(((p6==1)&&(p108==1)))) + EX(((p8==1)&&(p31==1))))) *...271
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p6==1)&&(p109==1)))] != FALSE + [(((FwdU(Init,TRUE) * EG(((!((E(!(((p3==1)&&(p113==1))) U...557
(forward)formula 0,1,0.529301,21324,1,0,7,63821,8,1,798,56410,1
FORMULA FireWire-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 108 transition count 291
Applied a total of 40 rules in 20 ms. Remains 108 /127 variables (removed 19) and now considering 291/338 (removed 47) transitions.
[2024-06-02 20:46:33] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 108 cols
[2024-06-02 20:46:33] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:46:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:46:33] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 20:46:33] [INFO ] Invariant cache hit.
[2024-06-02 20:46:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:46:33] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-02 20:46:33] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 20:46:33] [INFO ] Invariant cache hit.
[2024-06-02 20:46:33] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:46:34] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:46:34] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:46:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:46:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:46:35] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:46:35] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:46:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 451 constraints, problems are : Problem set: 0 solved, 290 unsolved in 22225 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints]
After SMT, in 34816ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 34819ms
Starting structural reductions in LTL mode, iteration 1 : 108/127 places, 291/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35058 ms. Remains : 108/127 places, 291/338 transitions.
[2024-06-02 20:47:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:47:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:47:08] [INFO ] Input system was already deterministic with 291 transitions.
[2024-06-02 20:47:08] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:47:08] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12242750019969089065.gal : 3 ms
[2024-06-02 20:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15401614267217793880.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/CTLFireability12242750019969089065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15401614267217793880.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.20233e+07,7.3525,176864,2,6153,5,485339,6,0,722,626041,0


Converting to forward existential form...Done !
original formula: EG(AG(((EF((p107==0)) + AG(((p5==0)||(p15==0)))) + (EX(((p4==1)&&(p46==1))) + EF(((p5==1)&&(p59==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((E(TRUE U (p107==0)) + !(E(TRUE U !(((p5==0)||(p15==0)))))) + (EX(((p4==1)&&(p46==1))) ...202
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2024-06-02 20:47:38] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:47:38] [INFO ] Applying decomposition
[2024-06-02 20:47:38] [INFO ] Flatten gal took : 9 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/graph14014451663859911105.txt' '-o' '/tmp/graph14014451663859911105.bin' '-w' '/tmp/graph14014451663859911105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14014451663859911105.bin' '-l' '-1' '-v' '-w' '/tmp/graph14014451663859911105.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:47:38] [INFO ] Decomposing Gal with order
[2024-06-02 20:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:47:38] [INFO ] Removed a total of 442 redundant transitions.
[2024-06-02 20:47:38] [INFO ] Flatten gal took : 50 ms
[2024-06-02 20:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 5 ms.
[2024-06-02 20:47:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17891363614124681750.gal : 3 ms
[2024-06-02 20:47:38] [INFO ] Time to serialize properties into /tmp/CTLFireability850739823290801949.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/CTLFireability17891363614124681750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability850739823290801949.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.20233e+07,5.50851,185824,2598,182,271073,1423,533,1.08825e+06,90,12305,0


Converting to forward existential form...Done !
original formula: EG(AG(((EF((i6.u35.p107==0)) + AG(((i1.u1.p5==0)||(i1.u5.p15==0)))) + (EX(((i1.u1.p4==1)&&(i1.u14.p46==1))) + EF(((i1.u1.p5==1)&&(i3.u18....168
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((E(TRUE U (i6.u35.p107==0)) + !(E(TRUE U !(((i1.u1.p5==0)||(i1.u5.p15==0)))))) + (EX(((...247
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...779
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 8
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
(forward)formula 0,1,24.536,699116,1,0,1.00861e+06,4949,3233,4.29619e+06,401,33703,2456842
FORMULA FireWire-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Applied a total of 41 rules in 9 ms. Remains 108 /127 variables (removed 19) and now considering 290/338 (removed 48) transitions.
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 108 cols
[2024-06-02 20:48:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:48:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:48:03] [INFO ] Invariant cache hit.
[2024-06-02 20:48:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:48:03] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:48:03] [INFO ] Invariant cache hit.
[2024-06-02 20:48:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:48:04] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/371 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 164 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11489 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/371 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 289/452 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:48:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 454 constraints, problems are : Problem set: 0 solved, 289 unsolved in 26870 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 11/11 constraints]
After SMT, in 38552ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 38554ms
Starting structural reductions in LTL mode, iteration 1 : 108/127 places, 290/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38785 ms. Remains : 108/127 places, 290/338 transitions.
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:48:42] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 20:48:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:48:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12841588993869454019.gal : 2 ms
[2024-06-02 20:48:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1167118872797804711.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/CTLFireability12841588993869454019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1167118872797804711.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.13929e+07,5.80696,161772,2,6231,5,455410,6,0,721,548759,0


Converting to forward existential form...Done !
original formula: A((!((((A(((p8==1)&&(p98==1)) U ((p8==1)&&(p110==1))) * A(((p8==1)&&(p108==1)) U ((p66==1)&&(p97==1)))) * (EX(AX(((p8==1)&&(p54==1)))) * ...283
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !(E(TRUE U (p97==1)))) + !(EG(!(EX(((p38==1)&&(p49==1))))))))))) * !(E(!((E(TRUE U !(...674
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2024-06-02 20:49:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:49:12] [INFO ] Applying decomposition
[2024-06-02 20:49:12] [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/graph10485138956878852511.txt' '-o' '/tmp/graph10485138956878852511.bin' '-w' '/tmp/graph10485138956878852511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10485138956878852511.bin' '-l' '-1' '-v' '-w' '/tmp/graph10485138956878852511.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:49:12] [INFO ] Decomposing Gal with order
[2024-06-02 20:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:49:12] [INFO ] Removed a total of 445 redundant transitions.
[2024-06-02 20:49:12] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 7 ms.
[2024-06-02 20:49:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10249999933208400205.gal : 2 ms
[2024-06-02 20:49:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16137477747885637946.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/CTLFireability10249999933208400205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16137477747885637946.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.13929e+07,5.65009,152296,2173,106,230357,808,576,635773,81,4456,0


Converting to forward existential form...Done !
original formula: A((!((((A(((i4.u2.p8==1)&&(i7.u33.p98==1)) U ((i4.u2.p8==1)&&(i6.i1.u37.p110==1))) * A(((i4.u2.p8==1)&&(i7.u36.p108==1)) U ((i2.u20.p66==...411
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !(E(TRUE U (i7.u33.p97==1)))) + !(EG(!(EX(((i1.u12.p38==1)&&(i5.u16.p49==1)))))))))))...904
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t45, t48, t49, t50, t57, t59, t79, t82, t87, t94, t99, t103, t136, t137, t138, t140...815
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
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 43 place count 106 transition count 288
Applied a total of 43 rules in 33 ms. Remains 106 /127 variables (removed 21) and now considering 288/338 (removed 50) transitions.
[2024-06-02 20:49:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 106 cols
[2024-06-02 20:49:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:49:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 20:49:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:49:42] [INFO ] Invariant cache hit.
[2024-06-02 20:49:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:49:42] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 20:49:42] [INFO ] Redundant transitions in 3 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 20:49:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:49:42] [INFO ] Invariant cache hit.
[2024-06-02 20:49:42] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:49:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:49:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:49:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:49:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 20:49:44] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 261/366 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/368 variables, and 160 constraints, problems are : Problem set: 0 solved, 285 unsolved in 11309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 285/444 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/368 variables, and 445 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14266 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
After SMT, in 25706ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 25709ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/127 places, 288/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25986 ms. Remains : 106/127 places, 288/338 transitions.
[2024-06-02 20:50:08] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:50:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:08] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 20:50:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:50:08] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:50:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12770307453220686581.gal : 2 ms
[2024-06-02 20:50:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality532312419128349519.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/ReachabilityCardinality12770307453220686581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality532312419128349519.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2360 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 290 steps, run visited all 1 properties in 5 ms. (steps per millisecond=58 )
Probabilistic random walk after 290 steps, saw 224 distinct states, run finished after 11 ms. (steps per millisecond=26 ) properties seen :1
FORMULA FireWire-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.

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 ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
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 43 place count 106 transition count 288
Applied a total of 43 rules in 25 ms. Remains 106 /127 variables (removed 21) and now considering 288/338 (removed 50) transitions.
[2024-06-02 20:50:08] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:50:08] [INFO ] Invariant cache hit.
[2024-06-02 20:50:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:50:08] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:50:08] [INFO ] Invariant cache hit.
[2024-06-02 20:50:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:50:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 20:50:08] [INFO ] Redundant transitions in 2 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 20:50:08] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:50:08] [INFO ] Invariant cache hit.
[2024-06-02 20:50:08] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 20:50:09] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2024-06-02 20:50:09] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:50:09] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-02 20:50:09] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:50:09] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:50:10] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:50:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:50:10] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:50:10] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 20:50:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 261/366 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/368 variables, and 160 constraints, problems are : Problem set: 0 solved, 285 unsolved in 11414 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 285/444 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/368 variables, and 445 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 10/10 constraints]
After SMT, in 26099ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 26102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/127 places, 288/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26331 ms. Remains : 106/127 places, 288/338 transitions.
[2024-06-02 20:50:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:50:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:50:34] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 20:50:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:50:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17827873322886603338.gal : 3 ms
[2024-06-02 20:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10000013291457251262.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/CTLFireability17827873322886603338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10000013291457251262.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.30099e+06,4.01535,117712,2,5586,5,338082,6,0,711,424159,0


Converting to forward existential form...Done !
original formula: E((!(A(!((((p8==1)&&(p55==1))||((p4==1)&&(p86==1)))) U ((p4==1)&&(p46==1)))) * (((!((p8==1)&&(p55==1)))||(p101!=1))||((p3==1)&&(p19==1)))...180
=> equivalent forward existential formula: [(FwdU(Init,(!(!((E(!(((p4==1)&&(p46==1))) U (!(!((((p8==1)&&(p55==1))||((p4==1)&&(p86==1))))) * !(((p4==1)&&(p4...293
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...618
Detected timeout of ITS tools.
[2024-06-02 20:51:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:51:04] [INFO ] Applying decomposition
[2024-06-02 20:51:04] [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/graph1262332911231894646.txt' '-o' '/tmp/graph1262332911231894646.bin' '-w' '/tmp/graph1262332911231894646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1262332911231894646.bin' '-l' '-1' '-v' '-w' '/tmp/graph1262332911231894646.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:51:04] [INFO ] Decomposing Gal with order
[2024-06-02 20:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:51:04] [INFO ] Removed a total of 441 redundant transitions.
[2024-06-02 20:51:04] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 7 ms.
[2024-06-02 20:51:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13003073887734578070.gal : 2 ms
[2024-06-02 20:51:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15504755710727916651.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/CTLFireability13003073887734578070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15504755710727916651.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 105 transition count 286
Applied a total of 45 rules in 37 ms. Remains 105 /127 variables (removed 22) and now considering 286/338 (removed 52) transitions.
[2024-06-02 20:51:35] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2024-06-02 20:51:35] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:51:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:51:35] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:51:35] [INFO ] Invariant cache hit.
[2024-06-02 20:51:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:51:35] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-02 20:51:35] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:51:35] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:51:35] [INFO ] Invariant cache hit.
[2024-06-02 20:51:35] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/365 variables, and 157 constraints, problems are : Problem set: 0 solved, 283 unsolved in 12374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/439 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/365 variables, and 440 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14513 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 8/8 constraints]
After SMT, in 27042ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27047ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/127 places, 286/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27321 ms. Remains : 105/127 places, 286/338 transitions.
[2024-06-02 20:52:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:02] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:52:02] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 20:52:02] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:52:02] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:52:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9841825534855126958.gal : 1 ms
[2024-06-02 20:52:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13552731680395859491.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9841825534855126958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13552731680395859491.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2366 resets) in 172 ms. (231 steps per ms) remains 1/1 properties

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 ...329
BEST_FIRST walk for 40004 steps (28 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 281 steps, run visited all 1 properties in 6 ms. (steps per millisecond=46 )
Probabilistic random walk after 281 steps, saw 215 distinct states, run finished after 6 ms. (steps per millisecond=46 ) properties seen :1
FORMULA FireWire-PT-08-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, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 108 transition count 291
Applied a total of 40 rules in 12 ms. Remains 108 /127 variables (removed 19) and now considering 291/338 (removed 47) transitions.
[2024-06-02 20:52:02] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 108 cols
[2024-06-02 20:52:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:02] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:52:02] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 20:52:02] [INFO ] Invariant cache hit.
[2024-06-02 20:52:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:52:02] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-02 20:52:02] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 20:52:02] [INFO ] Invariant cache hit.
[2024-06-02 20:52:02] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:52:05] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 264/372 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 164 constraints, problems are : Problem set: 0 solved, 290 unsolved in 10491 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/453 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:52:28] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 11/11 constraints]
After SMT, in 40652ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 40656ms
Starting structural reductions in LTL mode, iteration 1 : 108/127 places, 291/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40872 ms. Remains : 108/127 places, 291/338 transitions.
[2024-06-02 20:52:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:43] [INFO ] Input system was already deterministic with 291 transitions.
[2024-06-02 20:52:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:52:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9702650686453947767.gal : 2 ms
[2024-06-02 20:52:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7447546704911371.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/CTLFireability9702650686453947767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7447546704911371.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 -...280
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.20233e+07,6.84441,181064,2,6350,5,511453,6,0,722,674894,0


Converting to forward existential form...Done !
original formula: EX(AG((EG(((p5==0)||(p39==0))) * AF((p110==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((EG(((p5==0)||(p39==0))) * !(EG(!((p110==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:53:13] [INFO ] Applying decomposition
[2024-06-02 20:53:13] [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/graph3336540865390985175.txt' '-o' '/tmp/graph3336540865390985175.bin' '-w' '/tmp/graph3336540865390985175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3336540865390985175.bin' '-l' '-1' '-v' '-w' '/tmp/graph3336540865390985175.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:53:13] [INFO ] Decomposing Gal with order
[2024-06-02 20:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:53:13] [INFO ] Removed a total of 445 redundant transitions.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 6 ms.
[2024-06-02 20:53:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1053137135884255847.gal : 2 ms
[2024-06-02 20:53:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11879363848691479098.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/CTLFireability1053137135884255847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11879363848691479098.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.20233e+07,1.72751,52820,1158,138,91140,1049,617,197428,86,6188,0


Converting to forward existential form...Done !
original formula: EX(AG((EG(((i0.i2.u1.p5==0)||(i0.i2.u13.p39==0))) * AF((i4.i1.u37.p110==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((EG(((i0.i2.u1.p5==0)||(i0.i2.u13.p39==0))) * !(EG(!((i4.i1.u37.p110==0)))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...810
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 0,0,15.3198,467328,1,0,805996,3326,3168,1.86284e+06,360,20819,1208515
FORMULA FireWire-PT-08-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 327
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 122 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 120 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 293
Applied a total of 39 rules in 9 ms. Remains 109 /127 variables (removed 18) and now considering 293/338 (removed 45) transitions.
[2024-06-02 20:53:28] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2024-06-02 20:53:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:53:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:53:28] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 20:53:28] [INFO ] Invariant cache hit.
[2024-06-02 20:53:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:53:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-06-02 20:53:29] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 20:53:29] [INFO ] Invariant cache hit.
[2024-06-02 20:53:29] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:53:30] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 20:53:32] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 266/375 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 38/166 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 167 constraints, problems are : Problem set: 0 solved, 292 unsolved in 9154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 20:53:39] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 266/375 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 38/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 292/459 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 460 constraints, problems are : Problem set: 0 solved, 292 unsolved in 24234 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 12/12 constraints]
After SMT, in 33532ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 33535ms
Starting structural reductions in LTL mode, iteration 1 : 109/127 places, 293/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33752 ms. Remains : 109/127 places, 293/338 transitions.
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:54:02] [INFO ] Input system was already deterministic with 293 transitions.
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:54:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13049219628946544076.gal : 2 ms
[2024-06-02 20:54:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1214468239144931376.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/CTLFireability13049219628946544076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1214468239144931376.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.20084e+07,5.67468,169260,2,6197,5,455845,6,0,728,578148,0


Converting to forward existential form...Done !
original formula: AG((!(E((A(((p10==1)&&(p42==1)) U ((p8==1)&&(p109==1))) + ((p8==1)&&(p60==1))) U EF(AG((p29==1))))) + (AX((E(((p9==1)&&(p41==1)) U ((p4==...265
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !(!(E((!((E(!(((p8==1)&&(p109==1))) U (!(((p10==1)&&(p42==1))) * !(((p8==1)&&(p109==1)...702
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Detected timeout of ITS tools.
[2024-06-02 20:54:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:54:32] [INFO ] Applying decomposition
[2024-06-02 20:54:32] [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/graph8903163292539030774.txt' '-o' '/tmp/graph8903163292539030774.bin' '-w' '/tmp/graph8903163292539030774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8903163292539030774.bin' '-l' '-1' '-v' '-w' '/tmp/graph8903163292539030774.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:54:32] [INFO ] Decomposing Gal with order
[2024-06-02 20:54:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:54:32] [INFO ] Removed a total of 446 redundant transitions.
[2024-06-02 20:54:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:54:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 4 ms.
[2024-06-02 20:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9683038050656232709.gal : 2 ms
[2024-06-02 20:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7470768179932052737.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/CTLFireability9683038050656232709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7470768179932052737.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.20084e+07,6.99913,151036,1296,213,164168,10451,609,920213,92,75207,0


Converting to forward existential form...Done !
original formula: AG((!(E((A(((i2.i2.u3.p10==1)&&(i0.u13.p42==1)) U ((i1.u2.p8==1)&&(i5.i1.u34.p109==1))) + ((i1.u2.p8==1)&&(i3.u19.p60==1))) U EF(AG((i1.u...404
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !(!(E((!((E(!(((i1.u2.p8==1)&&(i5.i1.u34.p109==1))) U (!(((i2.i2.u3.p10==1)&&(i0.u13.p...981
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...819
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 121 transition count 323
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 118 transition count 316
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
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 22 place count 116 transition count 313
Applied a total of 22 rules in 19 ms. Remains 116 /127 variables (removed 11) and now considering 313/338 (removed 25) transitions.
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
// Phase 1: matrix 287 rows 116 cols
[2024-06-02 20:55:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:55:03] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-02 20:55:03] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 20:55:03] [INFO ] Invariant cache hit.
[2024-06-02 20:55:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:55:03] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-06-02 20:55:03] [INFO ] Redundant transitions in 1 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-02 20:55:03] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 20:55:03] [INFO ] Invariant cache hit.
[2024-06-02 20:55:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 20:55:04] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:55:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:55:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:55:04] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:55:05] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:55:05] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-02 20:55:05] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:55:05] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-06-02 20:55:05] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 286/401 variables, 115/132 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 20:55:09] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 174 constraints, problems are : Problem set: 0 solved, 310 unsolved in 14849 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 286/401 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 20:55:21] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/402 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 485 constraints, problems are : Problem set: 0 solved, 310 unsolved in 23179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 11/11 constraints]
After SMT, in 38242ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 38246ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/127 places, 313/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38981 ms. Remains : 116/127 places, 313/338 transitions.
[2024-06-02 20:55:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:41] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-02 20:55:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13798299617628506338.gal : 2 ms
[2024-06-02 20:55:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12647231484629971758.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/CTLFireability13798299617628506338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12647231484629971758.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.66491e+06,0.428233,18920,2,2306,5,62380,6,0,776,51357,0


Converting to forward existential form...Done !
original formula: AG(!(E(EG(((((p3==1)&&(p77==1))||((p3==1)&&(p91==1)))&&(!((p3==1)&&(p43==1))))) U EG(EF(((p11==1)&&(p96==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),EG(((((p3==1)&&(p77==1))||((p3==1)&&(p91==1)))&&(!((p3==1)&&(p43==1)))))),E(TRUE U ((...184
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...678
(forward)formula 0,0,9.38128,282208,1,0,718,1.39176e+06,659,361,6584,1.09522e+06,831
FORMULA FireWire-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 122 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Applied a total of 25 rules in 5 ms. Remains 116 /127 variables (removed 11) and now considering 309/338 (removed 29) transitions.
[2024-06-02 20:55:51] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 116 cols
[2024-06-02 20:55:51] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:55:51] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 20:55:51] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:55:51] [INFO ] Invariant cache hit.
[2024-06-02 20:55:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:55:51] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 20:55:51] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:55:51] [INFO ] Invariant cache hit.
[2024-06-02 20:55:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:55:53] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:55:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/398 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 173 constraints, problems are : Problem set: 0 solved, 308 unsolved in 12285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/398 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 308/480 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:56:10] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 1/399 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 482 constraints, problems are : Problem set: 0 solved, 308 unsolved in 25228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 9/9 constraints]
After SMT, in 37688ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 37691ms
Starting structural reductions in LTL mode, iteration 1 : 116/127 places, 309/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38045 ms. Remains : 116/127 places, 309/338 transitions.
[2024-06-02 20:56:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:29] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-02 20:56:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability858549639702781290.gal : 12 ms
[2024-06-02 20:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15945546819781597676.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/CTLFireability858549639702781290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15945546819781597676.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.27788e+07,1.57536,52956,2,2690,5,172757,6,0,772,173177,0


Converting to forward existential form...Done !
original formula: ((E(E(((p4==1)&&(p120==1)) U (p55==1)) U (EF((EF(((p38==1)&&(p49==1))) + E(((p6==1)&&(p30==1)) U ((p7==1)&&(p108==1))))) + !((!(AX(((p6==...450
=> equivalent forward existential formula: [(FwdU(FwdU((Init * (E(E(((p4==1)&&(p120==1)) U (p55==1)) U (E(TRUE U (E(TRUE U ((p38==1)&&(p49==1))) + E(((p6==...608
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...667
Detected timeout of ITS tools.
[2024-06-02 20:56:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:59] [INFO ] Applying decomposition
[2024-06-02 20:56:59] [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/graph15431241233353535282.txt' '-o' '/tmp/graph15431241233353535282.bin' '-w' '/tmp/graph15431241233353535282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15431241233353535282.bin' '-l' '-1' '-v' '-w' '/tmp/graph15431241233353535282.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:56:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:56:59] [INFO ] Removed a total of 477 redundant transitions.
[2024-06-02 20:56:59] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:56:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 3 ms.
[2024-06-02 20:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15874850729939542336.gal : 2 ms
[2024-06-02 20:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13206832906228581649.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/CTLFireability15874850729939542336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13206832906228581649.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.27788e+07,1.3925,47296,1334,170,70328,1610,565,168198,87,10824,0


Converting to forward existential form...Done !
original formula: ((E(E(((i3.u1.p4==1)&&(i0.u39.p120==1)) U (i4.u18.p55==1)) U (EF((EF(((i3.u12.p38==1)&&(i4.u16.p49==1))) + E(((i6.i1.u37.p6==1)&&(i2.u11....676
=> equivalent forward existential formula: [(FwdU(FwdU((Init * (E(E(((i3.u1.p4==1)&&(i0.u39.p120==1)) U (i4.u18.p55==1)) U (E(TRUE U (E(TRUE U ((i3.u12.p38...860
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t69, t79, t87, t94, t97, t99, t136, t137, t138, t...816
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 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
(forward)formula 0,1,18.1717,512804,1,0,746161,6388,3508,2.04414e+06,408,51282,1591036
FORMULA FireWire-PT-08-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Applied a total of 23 rules in 9 ms. Remains 117 /127 variables (removed 10) and now considering 312/338 (removed 26) transitions.
[2024-06-02 20:57:17] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 117 cols
[2024-06-02 20:57:17] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 20:57:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 20:57:18] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 20:57:18] [INFO ] Invariant cache hit.
[2024-06-02 20:57:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:57:18] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 20:57:18] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 20:57:18] [INFO ] Invariant cache hit.
[2024-06-02 20:57:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 20:57:19] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:57:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:57:20] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 176 constraints, problems are : Problem set: 0 solved, 311 unsolved in 12760 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 311/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/403 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 0/403 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 487 constraints, problems are : Problem set: 0 solved, 311 unsolved in 24965 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 9/9 constraints]
After SMT, in 37913ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 37917ms
Starting structural reductions in LTL mode, iteration 1 : 117/127 places, 312/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38173 ms. Remains : 117/127 places, 312/338 transitions.
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10682122460127108088.gal : 2 ms
[2024-06-02 20:57:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11419355889342248862.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/CTLFireability10682122460127108088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11419355889342248862.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.15701e+07,0.486033,21808,2,2375,5,66115,6,0,779,56393,0


Converting to forward existential form...Done !
original formula: EF(((EX(((p3==0)||(p91==0))) * AG(AX(((p3==0)||(p77==0))))) * ((p6==0)||(p103==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p6==0)||(p103==0))) * EX(((p3==0)||(p91==0)))) * !(E(TRUE U !(!(EX(!(((p3==0)||(p77==0))...172
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...678
(forward)formula 0,1,8.27012,236148,1,0,730,1.24898e+06,645,368,6550,932063,825
FORMULA FireWire-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Applied a total of 18 rules in 7 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2024-06-02 20:58:04] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 20:58:04] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:58:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 20:58:04] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:58:04] [INFO ] Invariant cache hit.
[2024-06-02 20:58:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:58:04] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 20:58:04] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:58:04] [INFO ] Invariant cache hit.
[2024-06-02 20:58:04] [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, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:58:06] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 3 ms to minimize.
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 179 constraints, problems are : Problem set: 0 solved, 316 unsolved in 13115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 495 constraints, problems are : Problem set: 0 solved, 316 unsolved in 22848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 10/10 constraints]
After SMT, in 36147ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 36150ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36403 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 20:58:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:58:40] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 20:58:40] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12546228266099025982.gal : 1 ms
[2024-06-02 20:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9102289066909477550.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/CTLFireability12546228266099025982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9102289066909477550.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.2251e+07,0.808498,30836,2,2342,5,95650,6,0,792,97320,0


Converting to forward existential form...Done !
original formula: AG((((EF(((((p8==1)&&(p101==1))||((p8==1)&&(p98==1)))||(((p11==1)&&(p24==1))||((p6==1)&&(p51==1))))) + EX(TRUE)) + (EG(EF(((p4==0)||(p78=...253
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((p8==1)&&(p101==1))||((p8==1)&&(p98==1)))||(((p11==1)&&(p24==1))||((p6...758
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...685
Detected timeout of ITS tools.
[2024-06-02 20:59:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:59:11] [INFO ] Applying decomposition
[2024-06-02 20:59:11] [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/graph7558545281232605817.txt' '-o' '/tmp/graph7558545281232605817.bin' '-w' '/tmp/graph7558545281232605817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7558545281232605817.bin' '-l' '-1' '-v' '-w' '/tmp/graph7558545281232605817.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:59:11] [INFO ] Decomposing Gal with order
[2024-06-02 20:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:59:11] [INFO ] Removed a total of 494 redundant transitions.
[2024-06-02 20:59:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 4 ms.
[2024-06-02 20:59:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2467653140266875825.gal : 1 ms
[2024-06-02 20:59:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3491869604606433796.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/CTLFireability2467653140266875825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3491869604606433796.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.2251e+07,7.26649,175684,1824,97,237160,1060,629,907425,91,5147,0


Converting to forward existential form...Done !
original formula: AG((((EF(((((i3.u2.p8==1)&&(i5.u41.p101==1))||((i3.u2.p8==1)&&(i5.u31.p98==1)))||(((i1.i1.u3.p11==1)&&(i1.i0.u5.p24==1))||((i2.u8.p6==1)&...378
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((i3.u2.p8==1)&&(i5.u41.p101==1))||((i3.u2.p8==1)&&(i5.u31.p98==1)))||(...1061
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t48, t49, t51, t64, t69, t74, t79, t86, t91, t92, t93, t94, t97, t99, t140, t142, t1...861
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 288
Applied a total of 43 rules in 18 ms. Remains 107 /127 variables (removed 20) and now considering 288/338 (removed 50) transitions.
[2024-06-02 20:59:41] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2024-06-02 20:59:41] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:59:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:59:41] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:59:41] [INFO ] Invariant cache hit.
[2024-06-02 20:59:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:59:41] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-06-02 20:59:41] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:59:41] [INFO ] Invariant cache hit.
[2024-06-02 20:59:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:59:48] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:59:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 161 constraints, problems are : Problem set: 0 solved, 287 unsolved in 11326 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 448 constraints, problems are : Problem set: 0 solved, 287 unsolved in 19549 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
After SMT, in 31006ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 31009ms
Starting structural reductions in LTL mode, iteration 1 : 107/127 places, 288/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31255 ms. Remains : 107/127 places, 288/338 transitions.
[2024-06-02 21:00:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:00:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:00:12] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 21:00:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:00:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:00:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9578253691257302332.gal : 3 ms
[2024-06-02 21:00:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15412219586463056130.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/CTLFireability9578253691257302332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15412219586463056130.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.13746e+07,6.89618,161768,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: AX(AX(FALSE))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(FALSE))] = FALSE
(forward)formula 0,0,6.90433,161768,1,0,7,443377,7,1,1117,562005,2
FORMULA FireWire-PT-08-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 4 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2024-06-02 21:00:19] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 21:00:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:00:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:00:19] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 21:00:19] [INFO ] Invariant cache hit.
[2024-06-02 21:00:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 21:00:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 21:00:19] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 21:00:19] [INFO ] Invariant cache hit.
[2024-06-02 21:00:19] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 178 constraints, problems are : Problem set: 0 solved, 316 unsolved in 12843 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 494 constraints, problems are : Problem set: 0 solved, 316 unsolved in 27463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
After SMT, in 40487ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 40492ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40749 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 21:01:00] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:00] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:00] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 21:01:00] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:01:00] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:01:00] [INFO ] Time to serialize gal into /tmp/CTLFireability796884218716586163.gal : 2 ms
[2024-06-02 21:01:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6095241833895087994.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/CTLFireability796884218716586163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6095241833895087994.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 -...282
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.16095e+07,0.506802,21060,2,2300,5,63821,6,0,792,56410,0


Converting to forward existential form...Done !
original formula: (E((AX(A((((p6==1)&&(p108==1))||((p8==1)&&(p109==1))) U !(((p9==1)&&(p77==1))))) * A(((E((p25==1) U ((p9==1)&&(p123==1))) + !(((p7==1)&&(...356
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((p9==1)&&(p77==1)))) U (!((((p6==1)&&(p108==1))||((p8==1)&&(p109==1)))) * !(!(((...714
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
Detected timeout of ITS tools.
[2024-06-02 21:01:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:30] [INFO ] Applying decomposition
[2024-06-02 21:01:30] [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/graph372830882865414148.txt' '-o' '/tmp/graph372830882865414148.bin' '-w' '/tmp/graph372830882865414148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph372830882865414148.bin' '-l' '-1' '-v' '-w' '/tmp/graph372830882865414148.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:01:30] [INFO ] Decomposing Gal with order
[2024-06-02 21:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:01:30] [INFO ] Removed a total of 494 redundant transitions.
[2024-06-02 21:01:30] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 4 ms.
[2024-06-02 21:01:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1860001348967902496.gal : 2 ms
[2024-06-02 21:01:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17560124579997230118.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/CTLFireability1860001348967902496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17560124579997230118.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.16095e+07,6.44616,180416,3122,201,275684,1604,620,972700,88,13988,0


Converting to forward existential form...Done !
original formula: (E((AX(A((((i6.i1.u35.p6==1)&&(i6.i0.u36.p108==1))||((i2.u2.p8==1)&&(i6.i1.u35.p109==1))) U !(((i1.u3.p9==1)&&(i0.u24.p77==1))))) * A(((E...529
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((i1.u3.p9==1)&&(i0.u24.p77==1)))) U (!((((i6.i1.u35.p6==1)&&(i6.i0.u36.p108==1))...997
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t68, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140...898
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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.
[2024-06-02 21:02:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:02:00] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:02:00] [INFO ] Applying decomposition
[2024-06-02 21:02:00] [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/graph5644419374563061639.txt' '-o' '/tmp/graph5644419374563061639.bin' '-w' '/tmp/graph5644419374563061639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5644419374563061639.bin' '-l' '-1' '-v' '-w' '/tmp/graph5644419374563061639.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:02:00] [INFO ] Decomposing Gal with order
[2024-06-02 21:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:02:00] [INFO ] Removed a total of 531 redundant transitions.
[2024-06-02 21:02:00] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 3 ms.
[2024-06-02 21:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4006347224687049735.gal : 2 ms
[2024-06-02 21:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7795840358895077343.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/CTLFireability4006347224687049735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7795840358895077343.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 5 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.46954e+07,14.2484,289784,2998,198,393810,2180,619,1.15635e+06,89,23498,0


Converting to forward existential form...Done !
original formula: A((!((((A(((i4.u2.p8==1)&&(i5.u33.p98==1)) U ((i4.u2.p8==1)&&(i6.i1.u38.p110==1))) * A(((i4.u2.p8==1)&&(i5.u37.p108==1)) U ((i1.u20.p66==...411
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !(E(TRUE U (i5.u33.p97==1)))) + !(EG(!(EX(((i1.u12.p38==1)&&(i4.u16.p49==1)))))))))))...904
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t100, t107, t143, ...873
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
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
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 a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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,1,51.3359,1070640,1,0,1.42006e+06,7558,3311,5.41605e+06,377,57874,2654306
FORMULA FireWire-PT-08-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((!(A(!((((i4.u2.p8==1)&&(i4.u19.p55==1))||((i1.u1.p4==1)&&(i2.u29.p86==1)))) U ((i1.u1.p4==1)&&(i1.u15.p46==1)))) * (((!((i4.u2.p8==1)&...265
=> equivalent forward existential formula: [(FwdU(Init,(!(!((E(!(((i1.u1.p4==1)&&(i1.u15.p46==1))) U (!(!((((i4.u2.p8==1)&&(i4.u19.p55==1))||((i1.u1.p4==1)...404
(forward)formula 1,1,210.696,2212364,1,0,2.85654e+06,9093,1503,1.08738e+07,205,103362,5721800
FORMULA FireWire-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((!(E((A(((i2.u3.p10==1)&&(i1.u14.p42==1)) U ((i4.u2.p8==1)&&(i5.u36.p109==1))) + ((i4.u2.p8==1)&&(i4.u19.p60==1))) U EF(AG((i3.u10.p29...383
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !(!(E((!((E(!(((i4.u2.p8==1)&&(i5.u36.p109==1))) U (!(((i2.u3.p10==1)&&(i1.u14.p42==1)...942
(forward)formula 2,1,287.043,2548036,1,0,3.33253e+06,9093,1887,1.31874e+07,223,124320,2231720
FORMULA FireWire-PT-08-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((EF(((((i4.u2.p8==1)&&(i5.u35.p101==1))||((i4.u2.p8==1)&&(i5.u33.p98==1)))||(((i2.u3.p11==1)&&(i2.u5.p24==1))||((i5.u36.p6==1)&&(i4....367
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((i4.u2.p8==1)&&(i5.u35.p101==1))||((i4.u2.p8==1)&&(i5.u33.p98==1)))||(...1028
(forward)formula 3,1,312.259,2548036,1,0,3.33253e+06,9093,1944,1.31874e+07,227,124320,3934614
FORMULA FireWire-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E((AX(A((((i5.u36.p6==1)&&(i5.u37.p108==1))||((i4.u2.p8==1)&&(i5.u36.p109==1))) U !(((i2.u3.p9==1)&&(i0.u25.p77==1))))) * A(((E((i3.u8.p...523
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((i2.u3.p9==1)&&(i0.u25.p77==1)))) U (!((((i5.u36.p6==1)&&(i5.u37.p108==1))||((i4...991
(forward)formula 4,1,431.584,3104096,1,0,4.03582e+06,9093,2617,1.38976e+07,259,124320,2780590
FORMULA FireWire-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1616648 ms.

BK_STOP 1717362552969

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

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