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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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-16-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717368203103

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 22:43:24] [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 22:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:43:24] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 22:43:24] [INFO ] Transformed 254 places.
[2024-06-02 22:43:24] [INFO ] Transformed 368 transitions.
[2024-06-02 22:43:24] [INFO ] Found NUPN structural information;
[2024-06-02 22:43:24] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 85 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 214 transition count 331
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 214 transition count 331
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 206 transition count 323
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 206 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 205 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 205 transition count 322
Applied a total of 95 rules in 55 ms. Remains 205 /254 variables (removed 49) and now considering 322/368 (removed 46) transitions.
// Phase 1: matrix 322 rows 205 cols
[2024-06-02 22:43:24] [INFO ] Computed 4 invariants in 24 ms
[2024-06-02 22:43:25] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-02 22:43:25] [INFO ] Invariant cache hit.
[2024-06-02 22:43:25] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-02 22:43:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 15 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:43:29] [INFO ] Deduced a trap composed of 107 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:43:29] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:43:29] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:43:29] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
[2024-06-02 22:43:30] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 12/16 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 22:43:30] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:43:30] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 2/18 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 22:43:33] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/19 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/20 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 322/527 variables, 205/225 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/225 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 22:43:43] [INFO ] Deduced a trap composed of 125 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:43:43] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/527 variables, 2/227 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/227 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 22:43:49] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:43:49] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:43:49] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:43:49] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:43:49] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:43:50] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:43:50] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:43:50] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/527 variables, 8/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 235 constraints, problems are : Problem set: 11 solved, 310 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 11 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 26/30 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 322/527 variables, 205/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 310/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/527 variables, 0/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 545 constraints, problems are : Problem set: 11 solved, 310 unsolved in 17781 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 310/321 constraints, Known Traps: 26/26 constraints]
After SMT, in 47959ms problems are : Problem set: 11 solved, 310 unsolved
Search for dead transitions found 11 dead transitions in 47989ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/254 places, 311/368 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48714 ms. Remains : 205/254 places, 311/368 transitions.
Support contains 85 out of 205 places after structural reductions.
[2024-06-02 22:44:13] [INFO ] Flatten gal took : 60 ms
[2024-06-02 22:44:13] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:44:13] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 82 out of 205 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1994 ms. (20 steps per ms) remains 48/62 properties
BEST_FIRST walk for 4002 steps (10 resets) in 89 ms. (44 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (10 resets) in 139 ms. (28 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4001 steps (9 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4002 steps (11 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 50 ms. (78 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (12 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (10 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
// Phase 1: matrix 311 rows 205 cols
[2024-06-02 22:44:15] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 120/187 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 41 unsolved
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 112 places in 237 ms of which 2 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 293/480 variables, 187/197 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/197 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 10/490 variables, 5/202 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/202 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 12/502 variables, 5/207 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 10/512 variables, 5/212 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 4/516 variables, 3/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/516 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 215 constraints, problems are : Problem set: 5 solved, 40 unsolved in 3861 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 5 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 40 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/186 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 6/10 constraints. Problems are: Problem set: 6 solved, 39 unsolved
[2024-06-02 22:44:19] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:44:19] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 2/12 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 291/477 variables, 186/198 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 37/235 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/235 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 9/486 variables, 4/239 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/239 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 10/496 variables, 5/244 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/244 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 7/503 variables, 3/247 constraints. Problems are: Problem set: 8 solved, 37 unsolved
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 6 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 2/249 constraints. Problems are: Problem set: 8 solved, 37 unsolved
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 1/250 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/516 variables, and 250 constraints, problems are : Problem set: 8 solved, 37 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/205 constraints, PredecessorRefiner: 37/45 constraints, Known Traps: 11/11 constraints]
After SMT, in 8893ms problems are : Problem set: 8 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 111 edges and 205 vertex of which 14 / 205 are part of one of the 2 SCC in 6 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 193 transition count 267
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 165 transition count 265
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 164 transition count 260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 70 place count 159 transition count 260
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 70 place count 159 transition count 252
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 86 place count 151 transition count 252
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 90 place count 147 transition count 248
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 147 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 147 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 146 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 97 place count 146 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 99 place count 145 transition count 245
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 135 place count 127 transition count 227
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 143 place count 123 transition count 239
Free-agglomeration rule applied 12 times with reduction of 3 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 155 place count 123 transition count 224
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 176 place count 111 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 178 place count 111 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 182 place count 111 transition count 213
Applied a total of 182 rules in 68 ms. Remains 111 /205 variables (removed 94) and now considering 213/311 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 111/205 places, 213/311 transitions.
RANDOM walk for 40000 steps (10 resets) in 570 ms. (70 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (14 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 49 ms. (80 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 70 ms. (56 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 49 ms. (80 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (14 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (14 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (14 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (14 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (14 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
Probably explored full state space saw : 23012 states, properties seen :36
Probabilistic random walk after 95733 steps, saw 23012 distinct states, run finished after 344 ms. (steps per millisecond=278 ) properties seen :36
Explored full state space saw : 23012 states, properties seen :0
Exhaustive walk after 95733 steps, saw 23012 distinct states, run finished after 110 ms. (steps per millisecond=870 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:44:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:44:25] [INFO ] Flatten gal took : 17 ms
FORMULA FireWire-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:44:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:44:25] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 59 out of 205 places (down from 61) after GAL structural reductions.
Computed a total of 23 stabilizing places and 25 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 9 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 22:44:25] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:44:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:44:25] [INFO ] Invariant cache hit.
[2024-06-02 22:44:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 22:44:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-06-02 22:44:29] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:29] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:44:29] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:31] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:44:31] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 4 ms to minimize.
[2024-06-02 22:44:31] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:32] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:44:32] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 14493 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:41] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:44:45] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 17212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 31771ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 31775ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/205 places, 248/311 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32028 ms. Remains : 172/205 places, 248/311 transitions.
[2024-06-02 22:44:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:44:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:44:57] [INFO ] Input system was already deterministic with 248 transitions.
[2024-06-02 22:44:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:44:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:44:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6556324515532585890.gal : 6 ms
[2024-06-02 22:44:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16654618531164613789.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6556324515532585890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16654618531164613789.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.5349e+06,0.212193,11480,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t123, ...297
(forward)formula 0,0,1.28354,44608,1,0,399,165945,510,225,5814,171599,501
FORMULA FireWire-PT-16-CTLFireability-2024-00 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 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 285
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 273
Applied a total of 66 rules in 14 ms. Remains 173 /205 variables (removed 32) and now considering 273/311 (removed 38) transitions.
// Phase 1: matrix 273 rows 173 cols
[2024-06-02 22:44:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:44:58] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 22:44:58] [INFO ] Invariant cache hit.
[2024-06-02 22:44:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-02 22:44:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/12 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 273/446 variables, 173/185 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:45:05] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/186 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:45:11] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:45:11] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/446 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 188 constraints, problems are : Problem set: 15 solved, 257 unsolved in 17627 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 273/446 variables, 173/188 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 257/445 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:45:20] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:45:22] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 2/447 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/446 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 447 constraints, problems are : Problem set: 15 solved, 257 unsolved in 14828 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 257/272 constraints, Known Traps: 13/13 constraints]
After SMT, in 32557ms problems are : Problem set: 15 solved, 257 unsolved
Search for dead transitions found 15 dead transitions in 32559ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/205 places, 258/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32915 ms. Remains : 173/205 places, 258/311 transitions.
[2024-06-02 22:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:45:31] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 22:45:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:45:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5696144302713723843.gal : 4 ms
[2024-06-02 22:45:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15867201422965123080.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/CTLFireability5696144302713723843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15867201422965123080.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.56262e+06,0.169836,10376,2,2013,5,19218,6,0,951,25151,0


Converting to forward existential form...Done !
original formula: EX((AG((AX(FALSE) + EF(((p71==1)&&(p181==1))))) + ((p49==1)&&(p140==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((!(EX(!(FALSE))) + E(TRUE U ((p71==1)&&(p181==1))))))))] != FALSE + [(EY(Init) * ((p4...184
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t46, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t...302
(forward)formula 0,0,7.49429,232716,1,0,480,1.45024e+06,537,273,6366,940243,611
FORMULA FireWire-PT-16-CTLFireability-2024-01 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 : 205/205 places, 311/311 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 279
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 177 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 177 transition count 269
Applied a total of 57 rules in 6 ms. Remains 177 /205 variables (removed 28) and now considering 269/311 (removed 42) transitions.
// Phase 1: matrix 269 rows 177 cols
[2024-06-02 22:45:39] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:45:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:45:39] [INFO ] Invariant cache hit.
[2024-06-02 22:45:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-02 22:45:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 22:45:41] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:45:41] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:45:41] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
[2024-06-02 22:45:42] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
[2024-06-02 22:45:42] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:42] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:45:42] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:45:42] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:45:43] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 4/13 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:44] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 269/446 variables, 177/191 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:48] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 1/192 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/192 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/192 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 192 constraints, problems are : Problem set: 15 solved, 253 unsolved in 14923 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:55] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/16 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 269/446 variables, 177/193 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 253/446 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:59] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:45:59] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 2/448 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:46:02] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:46:02] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/450 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/450 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 15 solved, 253 unsolved in 19802 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 253/268 constraints, Known Traps: 16/16 constraints]
After SMT, in 34777ms problems are : Problem set: 15 solved, 253 unsolved
Search for dead transitions found 15 dead transitions in 34781ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/205 places, 254/311 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34989 ms. Remains : 177/205 places, 254/311 transitions.
[2024-06-02 22:46:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:46:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:46:14] [INFO ] Input system was already deterministic with 254 transitions.
[2024-06-02 22:46:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:46:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:46:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6907623689890641496.gal : 6 ms
[2024-06-02 22:46:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13723808887605948442.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/CTLFireability6907623689890641496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13723808887605948442.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.66595e+06,0.190553,11320,2,2199,5,21940,6,0,963,31116,0


Converting to forward existential form...Done !
original formula: E(EX(((!((p50==1)&&(p152==1)))||(p37==1))) U AX(((EX(((p70==1)&&(p103==1))) + AG(((p173==1)||(p89==1)))) + ((p123==1) + ((p195==1) * EX((...169
=> equivalent forward existential formula: [(FwdU(Init,EX(((!((p50==1)&&(p152==1)))||(p37==1)))) * !(EX(!(((EX(((p70==1)&&(p103==1))) + !(E(TRUE U !(((p173...233
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t45, t52, t65, t68, t82, t87, t92, t95, t97, t113, t120, t...308
(forward)formula 0,1,9.68896,259192,1,0,1537,890764,538,1008,6380,1.63938e+06,1688
FORMULA FireWire-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 174 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 174 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 174 transition count 267
Applied a total of 64 rules in 7 ms. Remains 174 /205 variables (removed 31) and now considering 267/311 (removed 44) transitions.
// Phase 1: matrix 267 rows 174 cols
[2024-06-02 22:46:24] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:46:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:46:24] [INFO ] Invariant cache hit.
[2024-06-02 22:46:24] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 22:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/11 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:46:28] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 4/15 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 267/441 variables, 174/189 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:31] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:46:31] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 2/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 191 constraints, problems are : Problem set: 18 solved, 248 unsolved in 12620 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 18 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:38] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/18 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:39] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/19 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 267/441 variables, 174/193 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 248/441 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:42] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:46:43] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 2/443 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:46:46] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/444 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/444 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 0/441 variables, 0/444 constraints. Problems are: Problem set: 18 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 444 constraints, problems are : Problem set: 18 solved, 248 unsolved in 20681 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 248/266 constraints, Known Traps: 18/18 constraints]
After SMT, in 33363ms problems are : Problem set: 18 solved, 248 unsolved
Search for dead transitions found 18 dead transitions in 33367ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/205 places, 249/311 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33602 ms. Remains : 174/205 places, 249/311 transitions.
[2024-06-02 22:46:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:57] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-02 22:46:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:46:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10203660381276406306.gal : 1 ms
[2024-06-02 22:46:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15603330474422440425.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/CTLFireability10203660381276406306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15603330474422440425.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.53752e+06,0.198309,11556,2,2107,5,22152,6,0,946,30923,0


Converting to forward existential form...Done !
original formula: AG(EF((((p151==1) * EX((p13==0))) * ((p14==1)&&(p154==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p151==1) * EX((p13==0))) * ((p14==1)&&(p154==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t88, t92, t94, t110, t118, t123, t124,...298
(forward)formula 0,0,1.27918,47088,1,0,400,183557,518,225,5905,179194,506
FORMULA FireWire-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 278
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 182 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 178 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 178 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 178 transition count 271
Applied a total of 56 rules in 4 ms. Remains 178 /205 variables (removed 27) and now considering 271/311 (removed 40) transitions.
// Phase 1: matrix 271 rows 178 cols
[2024-06-02 22:46:59] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:46:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:46:59] [INFO ] Invariant cache hit.
[2024-06-02 22:46:59] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 22:46:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:47:01] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:47:02] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:47:02] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
[2024-06-02 22:47:02] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 11/15 constraints. Problems are: Problem set: 18 solved, 252 unsolved
[2024-06-02 22:47:02] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:47:02] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/17 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 271/449 variables, 178/195 constraints. Problems are: Problem set: 18 solved, 252 unsolved
[2024-06-02 22:47:06] [INFO ] Deduced a trap composed of 108 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:47:06] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:47:06] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 3/198 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/198 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/449 variables, 0/198 constraints. Problems are: Problem set: 18 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 198 constraints, problems are : Problem set: 18 solved, 252 unsolved in 12950 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 18 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 16/20 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 271/449 variables, 178/198 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 252/450 constraints. Problems are: Problem set: 18 solved, 252 unsolved
[2024-06-02 22:47:15] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:47:15] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 2/452 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/452 constraints. Problems are: Problem set: 18 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/449 variables, 0/452 constraints. Problems are: Problem set: 18 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 452 constraints, problems are : Problem set: 18 solved, 252 unsolved in 15167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 252/270 constraints, Known Traps: 18/18 constraints]
After SMT, in 28162ms problems are : Problem set: 18 solved, 252 unsolved
Search for dead transitions found 18 dead transitions in 28166ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/205 places, 253/311 transitions.
Applied a total of 0 rules in 10 ms. Remains 178 /178 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28409 ms. Remains : 178/205 places, 253/311 transitions.
[2024-06-02 22:47:27] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:47:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:27] [INFO ] Input system was already deterministic with 253 transitions.
[2024-06-02 22:47:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability18235643632666907918.gal : 4 ms
[2024-06-02 22:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5364325374930463791.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/CTLFireability18235643632666907918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5364325374930463791.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.58192e+06,0.219,12636,2,2300,5,23668,6,0,966,35289,0


Converting to forward existential form...Done !
original formula: EG((EX(EX((((p173==1)||(p249==1))||((p71==1)&&(p100==1))))) + E((p43!=1) U ((!(A((p56==1) U (p97==1))) * (((p124==1)&&(p12==1))||(p148==1...178
=> equivalent forward existential formula: [FwdG(Init,(EX(EX((((p173==1)||(p249==1))||((p71==1)&&(p100==1))))) + E((p43!=1) U ((!(!((E(!((p97==1)) U (!((p5...272
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t25, t27, t33, t38, t43, t47, t51, t64, t67, t80, t86, t90, t94, t96, t109, t113, t...308
(forward)formula 0,0,13.5649,422468,1,0,826,2.72936e+06,544,429,6164,2.60594e+06,985
FORMULA FireWire-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 279
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 178 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 178 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 178 transition count 269
Applied a total of 56 rules in 4 ms. Remains 178 /205 variables (removed 27) and now considering 269/311 (removed 42) transitions.
// Phase 1: matrix 269 rows 178 cols
[2024-06-02 22:47:41] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:47:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 22:47:41] [INFO ] Invariant cache hit.
[2024-06-02 22:47:41] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-02 22:47:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:47:43] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
[2024-06-02 22:47:44] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
[2024-06-02 22:47:44] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 269/447 variables, 178/190 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:47:46] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:47:46] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:47:46] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:47:47] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 4/194 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/194 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/194 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 194 constraints, problems are : Problem set: 15 solved, 253 unsolved in 11827 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 15 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 269/447 variables, 178/194 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 253/447 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:47:56] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:47:56] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:47:56] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 3/450 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:48:00] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 1/451 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/451 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/451 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 451 constraints, problems are : Problem set: 15 solved, 253 unsolved in 19367 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 253/268 constraints, Known Traps: 16/16 constraints]
After SMT, in 31244ms problems are : Problem set: 15 solved, 253 unsolved
Search for dead transitions found 15 dead transitions in 31247ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/205 places, 254/311 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31479 ms. Remains : 178/205 places, 254/311 transitions.
[2024-06-02 22:48:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:48:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:48:12] [INFO ] Input system was already deterministic with 254 transitions.
[2024-06-02 22:48:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13105390975493940545.gal : 2 ms
[2024-06-02 22:48:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7943332504736291867.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/CTLFireability13105390975493940545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7943332504736291867.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.84287e+06,0.211399,12368,2,2217,5,23028,6,0,967,34064,0


Converting to forward existential form...Done !
original formula: EG(AG(((AF(((p57==0)||(p192==0))) * (((p138==1)||(p57==0))||((p149==0)||(p3==1)))) * (EX((p56==0)) + (((p64==0)&&(p26==0))&&(p217==0)))))...156
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((!(EG(!(((p57==0)||(p192==0))))) * (((p138==1)||(p57==0))||((p149==0)||(p3==1)))) * (EX...217
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t28, t33, t38, t43, t47, t51, t65, t68, t81, t86, t90, t94, t96, t109, t1...313
(forward)formula 0,0,6.67669,187828,1,0,589,1.13708e+06,542,303,6418,794005,729
FORMULA FireWire-PT-16-CTLFireability-2024-06 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 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 11 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 22:48:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:48:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:48:19] [INFO ] Invariant cache hit.
[2024-06-02 22:48:19] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 22:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:26] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:48:26] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 14292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:35] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:48:39] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 17362 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 31702ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 31705ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/205 places, 248/311 transitions.
Applied a total of 0 rules in 1 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31915 ms. Remains : 172/205 places, 248/311 transitions.
[2024-06-02 22:48:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:48:51] [INFO ] Input system was already deterministic with 248 transitions.
[2024-06-02 22:48:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:48:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2233038434776435205.gal : 2 ms
[2024-06-02 22:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17086490392735188510.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/CTLFireability2233038434776435205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17086490392735188510.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.5349e+06,0.204037,11556,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(FALSE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t123, ...297
(forward)formula 0,1,1.30258,48836,1,0,403,198511,510,227,5841,197089,505
FORMULA FireWire-PT-16-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 290
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 185 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 179 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 179 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 179 transition count 279
Applied a total of 54 rules in 11 ms. Remains 179 /205 variables (removed 26) and now considering 279/311 (removed 32) transitions.
// Phase 1: matrix 279 rows 179 cols
[2024-06-02 22:48:52] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:48:52] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:48:52] [INFO ] Invariant cache hit.
[2024-06-02 22:48:52] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-06-02 22:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 22:48:54] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:48:54] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:48:54] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 105 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:48:55] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
[2024-06-02 22:48:56] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 263 unsolved
[2024-06-02 22:48:56] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 5/19 constraints. Problems are: Problem set: 15 solved, 263 unsolved
[2024-06-02 22:48:59] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:48:59] [INFO ] Deduced a trap composed of 97 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 279/458 variables, 179/200 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/200 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/200 constraints. Problems are: Problem set: 15 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 200 constraints, problems are : Problem set: 15 solved, 263 unsolved in 13662 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 279/458 variables, 179/200 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 263/463 constraints. Problems are: Problem set: 15 solved, 263 unsolved
[2024-06-02 22:49:09] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/464 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/464 constraints. Problems are: Problem set: 15 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/464 constraints. Problems are: Problem set: 15 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 464 constraints, problems are : Problem set: 15 solved, 263 unsolved in 15717 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 263/278 constraints, Known Traps: 18/18 constraints]
After SMT, in 29432ms problems are : Problem set: 15 solved, 263 unsolved
Search for dead transitions found 15 dead transitions in 29437ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 179/205 places, 264/311 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29659 ms. Remains : 179/205 places, 264/311 transitions.
[2024-06-02 22:49:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:49:22] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:22] [INFO ] Input system was already deterministic with 264 transitions.
[2024-06-02 22:49:22] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:22] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16096115869502847355.gal : 1 ms
[2024-06-02 22:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9148172410658417198.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/CTLFireability16096115869502847355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9148172410658417198.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.70751e+06,0.132776,8792,2,2227,5,15253,6,0,981,18958,0


Converting to forward existential form...Done !
original formula: A(EX((p2==1)) U !(((!(((EX(((p49==1)&&(p125==1))) + (p224==1)) + (((p22==1)&&(p183==1))||(p69==1)))) * !(E(AG((p52==1)) U (((p22==1)&&(p1...225
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(((EX(((p49==1)&&(p125==1))) + (p224==1)) + (((p22==1)&&(p183==1))||(p69==1)))) * !(E(!(E(...772
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t46, t50, t59, t63, t66, t79, t80, t85, t89, t93, t95...323
(forward)formula 0,1,1.78206,64988,1,0,452,252819,559,243,6439,242885,562
FORMULA FireWire-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 170 edges and 205 vertex of which 18 / 205 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 248
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 143 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 141 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 99 place count 141 transition count 234
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 131 transition count 234
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 131 place count 119 transition count 212
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 119 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 119 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 118 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 146 place count 118 transition count 207
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 152 place count 115 transition count 207
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 113 transition count 202
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 113 transition count 202
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 178 place count 102 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 101 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 101 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 101 transition count 180
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 6 with 2 rules applied. Total rules applied 183 place count 100 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 99 transition count 178
Applied a total of 184 rules in 48 ms. Remains 99 /205 variables (removed 106) and now considering 178/311 (removed 133) transitions.
[2024-06-02 22:49:24] [INFO ] Flow matrix only has 175 transitions (discarded 3 similar events)
// Phase 1: matrix 175 rows 99 cols
[2024-06-02 22:49:24] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:24] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:49:24] [INFO ] Flow matrix only has 175 transitions (discarded 3 similar events)
[2024-06-02 22:49:24] [INFO ] Invariant cache hit.
[2024-06-02 22:49:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:49:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 22:49:24] [INFO ] Redundant transitions in 9 ms returned []
Running 173 sub problems to find dead transitions.
[2024-06-02 22:49:24] [INFO ] Flow matrix only has 175 transitions (discarded 3 similar events)
[2024-06-02 22:49:24] [INFO ] Invariant cache hit.
[2024-06-02 22:49:24] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 174/272 variables, 98/109 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 11/120 constraints. Problems are: Problem set: 15 solved, 158 unsolved
[2024-06-02 22:49:26] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 1/121 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 1/273 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/274 variables, and 122 constraints, problems are : Problem set: 15 solved, 158 unsolved in 6007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 158 unsolved
[2024-06-02 22:49:30] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 174/272 variables, 98/111 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 11/122 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 158/280 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/280 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 1/273 variables, 1/281 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/274 variables, and 281 constraints, problems are : Problem set: 15 solved, 158 unsolved in 5871 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 158/173 constraints, Known Traps: 9/9 constraints]
After SMT, in 11927ms problems are : Problem set: 15 solved, 158 unsolved
Search for dead transitions found 15 dead transitions in 11930ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 99/205 places, 163/311 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-02 22:49:36] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 12186 ms. Remains : 99/205 places, 163/311 transitions.
[2024-06-02 22:49:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:49:36] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:49:36] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-02 22:49:36] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:49:36] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:49:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality781979589271476575.gal : 2 ms
[2024-06-02 22:49:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15189799450821445016.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/ReachabilityCardinality781979589271476575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15189799450821445016.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality15189799450821445016.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 40
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :690 after 1438
RANDOM walk for 40000 steps (3837 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
Reachability property FireWire-PT-16-CTLFireability-2024-09 is true.
FORMULA FireWire-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2527,0.056227,5092,2,696,14,4137,6,0,557,3070,0
Total reachable state count : 2527

Verifying 1 reachability properties.
Reachability property FireWire-PT-16-CTLFireability-2024-09 is true.
BEST_FIRST walk for 40002 steps (1293 resets) in 108 ms. (366 steps per ms) remains 1/1 properties

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLFireability-2024-09,1,0.057179,5092,2,100,14,4137,7,0,560,3070,0
Finished probabilistic random walk after 35151 steps, run visited all 1 properties in 47 ms. (steps per millisecond=747 )
Probabilistic random walk after 35151 steps, saw 9685 distinct states, run finished after 50 ms. (steps per millisecond=703 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 264
Applied a total of 66 rules in 7 ms. Remains 173 /205 variables (removed 32) and now considering 264/311 (removed 47) transitions.
// Phase 1: matrix 264 rows 173 cols
[2024-06-02 22:49:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:49:36] [INFO ] Invariant cache hit.
[2024-06-02 22:49:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-02 22:49:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 22:49:38] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:49:38] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:49:39] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 22:49:39] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
[2024-06-02 22:49:39] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:49:40] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:49:40] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:49:40] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:49:40] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 4/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 264/437 variables, 173/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:49:43] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:49:44] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:49:44] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 3/189 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:49:47] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/437 variables, 1/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 190 constraints, problems are : Problem set: 15 solved, 248 unsolved in 16856 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 264/437 variables, 173/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 248/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:49:57] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:49:57] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 2/440 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:50:01] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 441 constraints, problems are : Problem set: 15 solved, 248 unsolved in 18502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 16/16 constraints]
After SMT, in 35408ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 35412ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/205 places, 249/311 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35604 ms. Remains : 173/205 places, 249/311 transitions.
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:50:12] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:50:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11899694007344252286.gal : 1 ms
[2024-06-02 22:50:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5509538330197481464.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/CTLFireability11899694007344252286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5509538330197481464.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.54863e+06,0.200112,11820,2,2097,5,23077,6,0,942,33457,0


Converting to forward existential form...Done !
original formula: AX(EF(AG((p171==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !((p171==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t46, t51, t64, t67, t80, t85, t89, t93, t95, t111, t1...301
(forward)formula 0,0,1.62934,56500,1,0,403,239610,519,227,6109,212968,511
FORMULA FireWire-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 175 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 175 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 175 transition count 267
Applied a total of 62 rules in 10 ms. Remains 175 /205 variables (removed 30) and now considering 267/311 (removed 44) transitions.
// Phase 1: matrix 267 rows 175 cols
[2024-06-02 22:50:13] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 22:50:15] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:50:16] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:50:17] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-06-02 22:50:17] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/16 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 267/442 variables, 175/191 constraints. Problems are: Problem set: 16 solved, 250 unsolved
[2024-06-02 22:50:19] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:50:20] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/193 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/193 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/193 constraints. Problems are: Problem set: 16 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 193 constraints, problems are : Problem set: 16 solved, 250 unsolved in 11479 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 16 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 14/18 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 267/442 variables, 175/193 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 250/443 constraints. Problems are: Problem set: 16 solved, 250 unsolved
[2024-06-02 22:50:28] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/444 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/444 constraints. Problems are: Problem set: 16 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/444 constraints. Problems are: Problem set: 16 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 444 constraints, problems are : Problem set: 16 solved, 250 unsolved in 14138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 250/266 constraints, Known Traps: 15/15 constraints]
After SMT, in 25671ms problems are : Problem set: 16 solved, 250 unsolved
Search for dead transitions found 16 dead transitions in 25675ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/205 places, 251/311 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25917 ms. Remains : 175/205 places, 251/311 transitions.
[2024-06-02 22:50:39] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:50:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:50:39] [INFO ] Input system was already deterministic with 251 transitions.
[2024-06-02 22:50:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:50:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:50:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13680245244448174452.gal : 1 ms
[2024-06-02 22:50:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15539763710056481374.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/CTLFireability13680245244448174452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15539763710056481374.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.57758e+06,0.207782,11840,2,2130,5,22683,6,0,952,31678,0


Converting to forward existential form...Done !
original formula: AG((EF((p3==1)) + ((p92==1) * AX((p94==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U (p3==1)))) * !((p92==1)))] = FALSE * [(EY((FwdU(Init,TRUE) * !(E(TRUE U (p3==1)...184
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t89, t93, t95, t111, t119, t124, ...297
(forward)formula 0,0,2.98462,95304,1,0,426,485684,524,240,6193,377410,537
FORMULA FireWire-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 174 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 174 transition count 265
Applied a total of 64 rules in 12 ms. Remains 174 /205 variables (removed 31) and now considering 265/311 (removed 46) transitions.
// Phase 1: matrix 265 rows 174 cols
[2024-06-02 22:50:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:50:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:50:43] [INFO ] Invariant cache hit.
[2024-06-02 22:50:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 22:50:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 22:50:44] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:50:45] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:50:45] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:50:45] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:50:45] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:50:45] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-02 22:50:46] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-06-02 22:50:46] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
Problem TDEAD247 is UNSAT
[2024-06-02 22:50:46] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/187 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 22:50:48] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 1/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 188 constraints, problems are : Problem set: 15 solved, 249 unsolved in 11260 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/437 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 22:50:57] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:50:57] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/439 constraints. Problems are: Problem set: 15 solved, 249 unsolved
[2024-06-02 22:51:01] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 1/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/439 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 440 constraints, problems are : Problem set: 15 solved, 249 unsolved in 18090 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 13/13 constraints]
After SMT, in 29398ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 29402ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/205 places, 250/311 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29621 ms. Remains : 174/205 places, 250/311 transitions.
[2024-06-02 22:51:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:51:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:51:12] [INFO ] Input system was already deterministic with 250 transitions.
[2024-06-02 22:51:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:51:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:51:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8441935264596746599.gal : 1 ms
[2024-06-02 22:51:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6831130357879086333.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/CTLFireability8441935264596746599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6831130357879086333.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.55374e+06,0.210229,11828,2,2094,5,22272,6,0,947,31829,0


Converting to forward existential form...Done !
original formula: EF(((EX(((p242==0) * !(A((p141==1) U (p24==1))))) * (p167==1)) * EX(TRUE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (EX(((p242==0) * !(!((E(!((p24==1)) U (!((p141==1)) * !((p24==1)))) + EG(!((p24==1))))))...190
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t26, t28, t34, t39, t44, t52, t65, t68, t81, t86, t90, t94, t96, t112, t120, t125, ...297
(forward)formula 0,1,17.2792,488232,1,0,833,3.14241e+06,528,429,6041,3.19621e+06,994
FORMULA FireWire-PT-16-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 8 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-06-02 22:51:30] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 22:51:31] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:34] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:51:34] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/21 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:35] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:51:36] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:51:36] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/24 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 263/435 variables, 172/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/198 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 198 constraints, problems are : Problem set: 15 solved, 247 unsolved in 14457 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/27 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/200 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 247/447 constraints. Problems are: Problem set: 15 solved, 247 unsolved
[2024-06-02 22:51:50] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 15 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 15 solved, 247 unsolved in 17269 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 25/25 constraints]
After SMT, in 31780ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 31783ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/205 places, 248/311 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32007 ms. Remains : 172/205 places, 248/311 transitions.
[2024-06-02 22:52:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:52:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:02] [INFO ] Input system was already deterministic with 248 transitions.
[2024-06-02 22:52:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability660284441133193357.gal : 1 ms
[2024-06-02 22:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7199173684897158562.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/CTLFireability660284441133193357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7199173684897158562.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.5349e+06,0.197898,11552,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: EX(AF(AG((p224==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !((p224==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t123, ...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.14665,228140,1,0,584,1.4165e+06,525,350,6477,1.04143e+06,746
FORMULA FireWire-PT-16-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 264
Applied a total of 66 rules in 3 ms. Remains 173 /205 variables (removed 32) and now considering 264/311 (removed 47) transitions.
// Phase 1: matrix 264 rows 173 cols
[2024-06-02 22:52:10] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:52:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:52:10] [INFO ] Invariant cache hit.
[2024-06-02 22:52:10] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-02 22:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 22:52:12] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:52:12] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:52:12] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 22:52:13] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
[2024-06-02 22:52:13] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 264/437 variables, 173/182 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:52:15] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 1/183 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/183 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:52:20] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:52:20] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:52:20] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/437 variables, 3/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 186 constraints, problems are : Problem set: 15 solved, 248 unsolved in 15529 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 248 unsolved
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 264/437 variables, 173/190 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 248/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 438 constraints, problems are : Problem set: 15 solved, 248 unsolved in 12649 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 13/13 constraints]
After SMT, in 28229ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 28232ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/205 places, 249/311 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28440 ms. Remains : 173/205 places, 249/311 transitions.
[2024-06-02 22:52:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:38] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:52:38] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-02 22:52:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5335744059054408613.gal : 2 ms
[2024-06-02 22:52:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11051232785230127455.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/CTLFireability5335744059054408613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11051232785230127455.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.5595e+06,0.186494,11292,2,2067,5,21844,6,0,942,30121,0


Converting to forward existential form...Done !
original formula: EX((EF(((EX((p209==1)) + ((p32==1)&&(p169==1))) + ((p50==1)&&(p125==1)))) * EX(((AF((p126==0)) + (p148==0)) * EG((p151==0))))))
=> equivalent forward existential formula: [FwdG((EY((EY(Init) * E(TRUE U ((EX((p209==1)) + ((p32==1)&&(p169==1))) + ((p50==1)&&(p125==1)))))) * (!(EG(!((p...200
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t80, t85, t89, t93, t95, t111, t119, t124, ...297
Hit Full ! (commute/partial/dont) 242/0/7
(forward)formula 0,1,6.97246,208596,1,0,552,1.23466e+06,537,299,6557,885295,700
FORMULA FireWire-PT-16-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 171 edges and 205 vertex of which 18 / 205 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 248
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 143 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 141 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 99 place count 141 transition count 234
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 131 transition count 234
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 130 place count 120 transition count 214
Iterating global reduction 3 with 11 rules applied. Total rules applied 141 place count 120 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 120 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 119 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 144 place count 119 transition count 208
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 152 place count 115 transition count 208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 113 transition count 203
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 113 transition count 203
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 178 place count 102 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 101 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 101 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 101 transition count 181
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 6 with 2 rules applied. Total rules applied 183 place count 100 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 99 transition count 179
Applied a total of 184 rules in 30 ms. Remains 99 /205 variables (removed 106) and now considering 179/311 (removed 132) transitions.
[2024-06-02 22:52:45] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
// Phase 1: matrix 176 rows 99 cols
[2024-06-02 22:52:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:52:45] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2024-06-02 22:52:45] [INFO ] Invariant cache hit.
[2024-06-02 22:52:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:52:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 22:52:46] [INFO ] Redundant transitions in 7 ms returned []
Running 174 sub problems to find dead transitions.
[2024-06-02 22:52:46] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2024-06-02 22:52:46] [INFO ] Invariant cache hit.
[2024-06-02 22:52:46] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:52:46] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-02 22:52:47] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 175/273 variables, 98/110 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 11/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/275 variables, and 122 constraints, problems are : Problem set: 15 solved, 159 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 175/273 variables, 98/110 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 11/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 159/280 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/280 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/275 variables, and 281 constraints, problems are : Problem set: 15 solved, 159 unsolved in 5707 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 159/174 constraints, Known Traps: 8/8 constraints]
After SMT, in 10653ms problems are : Problem set: 15 solved, 159 unsolved
Search for dead transitions found 15 dead transitions in 10656ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 99/205 places, 164/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-06-02 22:52:56] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 10881 ms. Remains : 99/205 places, 164/311 transitions.
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:52:56] [INFO ] Input system was already deterministic with 164 transitions.
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:52:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9547719319133961457.gal : 1 ms
[2024-06-02 22:52:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality188868890457424085.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/ReachabilityCardinality9547719319133961457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality188868890457424085.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality188868890457424085.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 40
RANDOM walk for 40000 steps (3872 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :690 after 1438
BEST_FIRST walk for 40004 steps (1250 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Reachability property FireWire-PT-16-CTLFireability-2024-15 is true.
FORMULA FireWire-PT-16-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2625,0.038995,5236,2,711,14,4126,6,0,558,2863,0
Total reachable state count : 2625

Verifying 1 reachability properties.
Finished probabilistic random walk after 4000 steps, run visited all 1 properties in 9 ms. (steps per millisecond=444 )
Reachability property FireWire-PT-16-CTLFireability-2024-15 is true.

Probabilistic random walk after 4000 steps, saw 1334 distinct states, run finished after 10 ms. (steps per millisecond=400 ) properties seen :1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLFireability-2024-15,13,0.039516,5236,2,158,14,4126,7,0,561,2863,0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:52:56] [INFO ] Flatten gal took : 6 ms
Total runtime 572567 ms.

BK_STOP 1717368776895

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-16"
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-16, 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-171734899000290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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