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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360564140

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:36:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:36:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:36:05] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 20:36:05] [INFO ] Transformed 126 places.
[2024-06-02 20:36:05] [INFO ] Transformed 396 transitions.
[2024-06-02 20:36:05] [INFO ] Found NUPN structural information;
[2024-06-02 20:36:05] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 73 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 124 transition count 332
Applied a total of 11 rules in 33 ms. Remains 124 /126 variables (removed 2) and now considering 332/343 (removed 11) transitions.
[2024-06-02 20:36:05] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 124 cols
[2024-06-02 20:36:05] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 20:36:05] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-02 20:36:05] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 20:36:05] [INFO ] Invariant cache hit.
[2024-06-02 20:36:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:36:06] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-02 20:36:06] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 20:36:06] [INFO ] Invariant cache hit.
[2024-06-02 20:36:06] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 12 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 1/430 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 184 constraints, problems are : Problem set: 0 solved, 331 unsolved in 13922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 331/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 1/430 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/430 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 516 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 8/8 constraints]
After SMT, in 44298ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 44317ms
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 332/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44846 ms. Remains : 124/126 places, 332/343 transitions.
Support contains 73 out of 124 places after structural reductions.
[2024-06-02 20:36:50] [INFO ] Flatten gal took : 49 ms
[2024-06-02 20:36:50] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:36:50] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (2190 resets) in 1850 ms. (21 steps per ms) remains 34/69 properties
BEST_FIRST walk for 4003 steps (65 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (113 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (148 resets) in 67 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (76 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (82 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (107 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (63 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (102 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (104 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 57 ms. (69 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (92 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (106 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (68 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (112 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (125 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (64 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (155 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
[2024-06-02 20:36:51] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 20:36:51] [INFO ] Invariant cache hit.
[2024-06-02 20:36:51] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-02 20:36:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 4/123 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-02 20:36:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 305/428 variables, 123/133 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 44/177 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/429 variables, 1/178 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 1/430 variables, 1/179 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 179 constraints, problems are : Problem set: 2 solved, 31 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 77/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-02 20:36:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:36:53] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 4/123 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 305/428 variables, 123/135 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 44/179 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 29/208 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 1/429 variables, 1/209 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 2/211 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-02 20:36:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 1/212 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 1/430 variables, 1/213 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 213 constraints, problems are : Problem set: 2 solved, 31 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 31/33 constraints, Known Traps: 5/5 constraints]
After SMT, in 6429ms problems are : Problem set: 2 solved, 31 unsolved
Fused 31 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 899 ms.
Support contains 40 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 332/332 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 122 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 122 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 121 transition count 322
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 119 transition count 326
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 119 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 119 transition count 320
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 119 transition count 322
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 24 place count 118 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 118 transition count 318
Applied a total of 26 rules in 78 ms. Remains 118 /124 variables (removed 6) and now considering 318/332 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 118/124 places, 318/332 transitions.
RANDOM walk for 40000 steps (2183 resets) in 937 ms. (42 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (106 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (147 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (54 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (108 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (60 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (106 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (69 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (104 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (61 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (80 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (106 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (98 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (47 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (127 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (49 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (74 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 503414 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :21 out of 29
Probabilistic random walk after 503414 steps, saw 117791 distinct states, run finished after 3008 ms. (steps per millisecond=167 ) properties seen :21
[2024-06-02 20:37:02] [INFO ] Flow matrix only has 291 transitions (discarded 27 similar events)
// Phase 1: matrix 291 rows 118 cols
[2024-06-02 20:37:02] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:37:02] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 24/117 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 291/408 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/409 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 171 constraints, problems are : Problem set: 0 solved, 8 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:37:03] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:37:03] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 24/117 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:37:03] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 291/408 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/409 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 182 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1364ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 4051 ms.
Support contains 18 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 318/318 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 311
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 308
Applied a total of 9 rules in 32 ms. Remains 114 /118 variables (removed 4) and now considering 308/318 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 114/118 places, 308/318 transitions.
RANDOM walk for 40000 steps (2118 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (554 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (538 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (584 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (57 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1088 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (471 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (576 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 556630 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 8
Probabilistic random walk after 556630 steps, saw 125881 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-06-02 20:37:11] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 20:37:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:37:11] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 281/394 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 44/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 166 constraints, problems are : Problem set: 0 solved, 8 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:37:11] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:37:11] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:37:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 281/394 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 44/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 177 constraints, problems are : Problem set: 0 solved, 8 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 2857 ms.
Support contains 18 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 20 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 114/114 places, 308/308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-02 20:37:15] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 20:37:15] [INFO ] Invariant cache hit.
[2024-06-02 20:37:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:37:15] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 20:37:15] [INFO ] Invariant cache hit.
[2024-06-02 20:37:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:37:15] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 20:37:15] [INFO ] Redundant transitions in 17 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:37:15] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 20:37:15] [INFO ] Invariant cache hit.
[2024-06-02 20:37:15] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:37:17] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:37:18] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:37:18] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:37:18] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:37:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 281/395 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 176 constraints, problems are : Problem set: 0 solved, 307 unsolved in 10486 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/395 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 483 constraints, problems are : Problem set: 0 solved, 307 unsolved in 13739 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 24421ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 24425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24700 ms. Remains : 114/114 places, 308/308 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 77 edges and 114 vertex of which 16 / 114 are part of one of the 3 SCC in 3 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 101 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 101 transition count 219
Applied a total of 19 rules in 26 ms. Remains 101 /114 variables (removed 13) and now considering 219/308 (removed 89) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 219 rows 101 cols
[2024-06-02 20:37:40] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:37:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:37:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 20:37:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:37:40] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 20:37:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:37:40] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 133 ms
TRAPS : Iteration 1
[2024-06-02 20:37:40] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 20:37:41] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 849 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:37:41] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:37:41] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:37:41] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Applied a total of 22 rules in 11 ms. Remains 114 /124 variables (removed 10) and now considering 306/332 (removed 26) transitions.
[2024-06-02 20:37:41] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 114 cols
[2024-06-02 20:37:41] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:37:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:37:41] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:37:41] [INFO ] Invariant cache hit.
[2024-06-02 20:37:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:37:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 20:37:41] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:37:41] [INFO ] Invariant cache hit.
[2024-06-02 20:37:41] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:37:42] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:37:43] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/393 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 171 constraints, problems are : Problem set: 0 solved, 305 unsolved in 11876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/393 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 305/475 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:38:13] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/394 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 477 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 9/9 constraints]
After SMT, in 42098ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 42103ms
Starting structural reductions in LTL mode, iteration 1 : 114/124 places, 306/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42334 ms. Remains : 114/124 places, 306/332 transitions.
[2024-06-02 20:38:23] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:38:23] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:38:23] [INFO ] Input system was already deterministic with 306 transitions.
[2024-06-02 20:38:23] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:38:23] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14405445620611318539.gal : 6 ms
[2024-06-02 20:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4811966769824592935.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/CTLFireability14405445620611318539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4811966769824592935.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,6.3117e+06,1.08932,39796,2,2226,5,140971,6,0,761,128725,0


Converting to forward existential form...Done !
original formula: AX((AG(((p8==0)||(p102==0))) * (AG((((p3==1)&&(p116==1))||((p4==1)&&(p22==1)))) + EX(((p8==0)||(p50==0))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(((p8==0)||(p102==0))))] = FALSE * [(FwdU((EY(Init) * !(EX(((p8==0)||(p50==0))))),TRUE...216
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...660
(forward)formula 0,0,3.21164,85968,1,0,562,354233,630,285,6554,349559,621
FORMULA FireWire-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 112 transition count 302
Applied a total of 26 rules in 35 ms. Remains 112 /124 variables (removed 12) and now considering 302/332 (removed 30) transitions.
[2024-06-02 20:38:26] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 112 cols
[2024-06-02 20:38:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:38:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:38:26] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 20:38:26] [INFO ] Invariant cache hit.
[2024-06-02 20:38:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:38:27] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 20:38:27] [INFO ] Redundant transitions in 4 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-02 20:38:27] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 20:38:27] [INFO ] Invariant cache hit.
[2024-06-02 20:38:27] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:38:30] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:38:30] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 275/387 variables, 112/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 171 constraints, problems are : Problem set: 0 solved, 301 unsolved in 9711 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/387 variables, 112/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 301/471 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 472 constraints, problems are : Problem set: 0 solved, 301 unsolved in 22982 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 11/11 constraints]
After SMT, in 32878ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 32882ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/124 places, 302/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33138 ms. Remains : 112/124 places, 302/332 transitions.
[2024-06-02 20:38:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:39:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:00] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-02 20:39:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:39:00] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11502847177183609487.gal : 4 ms
[2024-06-02 20:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9903920491428176983.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/CTLFireability11502847177183609487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9903920491428176983.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,5.52753e+06,5.97037,170752,2,7833,5,448650,6,0,749,588641,0


Converting to forward existential form...Done !
original formula: EF((A(!((A(((p10==1)&&(p119==1)) U ((p3==1)&&(p17==1))) + ((p6==1)&&(p54==1)))) U EG(((((p10==1)&&(p85==1))||((p10==1)&&(p93==1))) * EG((...221
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(!(EG(((((p10==1)&&(p85==1))||((p10==1)&&(p93==1))) * EG(((p9==1)&&(p104==1)))))) U (...1419
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...643
Detected timeout of ITS tools.
[2024-06-02 20:39:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:39:30] [INFO ] Applying decomposition
[2024-06-02 20:39:30] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7846611607431672333.txt' '-o' '/tmp/graph7846611607431672333.bin' '-w' '/tmp/graph7846611607431672333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7846611607431672333.bin' '-l' '-1' '-v' '-w' '/tmp/graph7846611607431672333.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:39:30] [INFO ] Decomposing Gal with order
[2024-06-02 20:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:39:30] [INFO ] Removed a total of 470 redundant transitions.
[2024-06-02 20:39:30] [INFO ] Flatten gal took : 51 ms
[2024-06-02 20:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 13 ms.
[2024-06-02 20:39:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8607185374506085739.gal : 5 ms
[2024-06-02 20:39:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3654571597761527157.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/CTLFireability8607185374506085739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3654571597761527157.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.52753e+06,7.90632,204396,1477,98,268775,2538,619,1.12523e+06,86,19269,0


Converting to forward existential form...Done !
original formula: EF((A(!((A(((i6.i1.u3.p10==1)&&(i1.u38.p119==1)) U ((i1.u0.p3==1)&&(i2.u11.p17==1))) + ((i5.i1.u35.p6==1)&&(i3.u18.p54==1)))) U EG(((((i6...348
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(!(EG(((((i6.i1.u3.p10==1)&&(i6.i1.u29.p85==1))||((i6.i1.u3.p10==1)&&(i4.u32.p93==1))...2148
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t69, t79, t91, t92, t93, t94, t99, t140, t142, t1...816
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 17 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
[2024-06-02 20:40:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 20:40:00] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:40:00] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 20:40:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:40:00] [INFO ] Invariant cache hit.
[2024-06-02 20:40:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:40:00] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:40:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:40:00] [INFO ] Invariant cache hit.
[2024-06-02 20:40:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:40:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21934 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32552ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32556ms
Starting structural reductions in LTL mode, iteration 1 : 106/124 places, 287/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32885 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 20:40:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:40:33] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:40:33] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:40:33] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:40:33] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:40:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4246779256113734929.gal : 2 ms
[2024-06-02 20:40:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8695061375643499128.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/CTLFireability4246779256113734929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8695061375643499128.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,6.23367e+06,5.53698,169248,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: E(((p5==1)&&(p124==1)) U !(EF(((AX(FALSE) * (p11==1)) * (p35==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((p5==1)&&(p124==1))) * !(E(TRUE U ((!(EX(!(FALSE))) * (p11==1)) * (p35==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Hit Full ! (commute/partial/dont) 252/34/35
(forward)formula 0,1,7.34562,169248,1,0,516,456345,598,265,5985,596611,582
FORMULA FireWire-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 112 transition count 304
Applied a total of 24 rules in 25 ms. Remains 112 /124 variables (removed 12) and now considering 304/332 (removed 28) transitions.
[2024-06-02 20:40:40] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 112 cols
[2024-06-02 20:40:40] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:40:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:40:40] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:40:40] [INFO ] Invariant cache hit.
[2024-06-02 20:40:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:40:40] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 20:40:41] [INFO ] Redundant transitions in 4 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-02 20:40:41] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:40:41] [INFO ] Invariant cache hit.
[2024-06-02 20:40:41] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:40:42] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:40:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/390 variables, and 171 constraints, problems are : Problem set: 0 solved, 301 unsolved in 12628 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 301/471 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/390 variables, and 473 constraints, problems are : Problem set: 0 solved, 301 unsolved in 25217 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 13/13 constraints]
After SMT, in 38020ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 38024ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/124 places, 304/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38272 ms. Remains : 112/124 places, 304/332 transitions.
[2024-06-02 20:41:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:19] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:41:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:41:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:41:19] [INFO ] Time to serialize gal into /tmp/CTLFireability186162904848168040.gal : 3 ms
[2024-06-02 20:41:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3490957681563230274.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/CTLFireability186162904848168040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3490957681563230274.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,5.26573e+06,1.07884,38676,2,2307,5,137659,6,0,751,128214,0


Converting to forward existential form...Done !
original formula: EG(AG(!(A((((p9==1)&&(p116==1))||((p10==1)&&(p89==1))) U AG(((p8==1)&&(p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(!((E(!(!(E(TRUE U !(((p8==1)&&(p110==1)))))) U (!((((p9==1)&&(p116==1))||((p10==1)&&(p...271
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...654
(forward)formula 0,1,22.272,614424,1,0,646,3.25055e+06,634,331,6496,2.70187e+06,734
FORMULA FireWire-PT-07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 114 transition count 309
Applied a total of 19 rules in 23 ms. Remains 114 /124 variables (removed 10) and now considering 309/332 (removed 23) transitions.
[2024-06-02 20:41:41] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 114 cols
[2024-06-02 20:41:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:41:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:41:41] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:41:41] [INFO ] Invariant cache hit.
[2024-06-02 20:41:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:41:41] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 20:41:41] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-02 20:41:41] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:41:41] [INFO ] Invariant cache hit.
[2024-06-02 20:41:41] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 20:41:42] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:41:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:41:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 282/395 variables, 113/130 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 39/169 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 1/396 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 20:41:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/396 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/397 variables, and 171 constraints, problems are : Problem set: 0 solved, 306 unsolved in 16178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 282/395 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 306/476 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 20:42:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/397 variables, and 478 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 11/11 constraints]
After SMT, in 37954ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 37957ms
Starting structural reductions in SI_CTL mode, iteration 1 : 114/124 places, 309/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38195 ms. Remains : 114/124 places, 309/332 transitions.
[2024-06-02 20:42:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:42:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:42:19] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-02 20:42:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:42:19] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:42:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1526627467378595449.gal : 2 ms
[2024-06-02 20:42:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11608140831953552247.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/CTLFireability1526627467378595449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11608140831953552247.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,5.70761e+06,1.19771,43628,2,2431,5,156044,6,0,764,137539,0


Converting to forward existential form...Done !
original formula: E((EG((AF(((p11==1)&&(p48==1))) * A(((p3==1)&&(p78==1)) U ((p4==1)&&(p57==1))))) + AF(!(AG((((p10==1)&&(p94==1))||((p3==1)&&(p90==1))))))...179
=> equivalent forward existential formula: [(FwdU(Init,(EG((!(EG(!(((p11==1)&&(p48==1))))) * !((E(!(((p4==1)&&(p57==1))) U (!(((p3==1)&&(p78==1))) * !(((p4...316
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...660
Detected timeout of ITS tools.
[2024-06-02 20:42:49] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:42:49] [INFO ] Applying decomposition
[2024-06-02 20:42:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4153558901091317075.txt' '-o' '/tmp/graph4153558901091317075.bin' '-w' '/tmp/graph4153558901091317075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4153558901091317075.bin' '-l' '-1' '-v' '-w' '/tmp/graph4153558901091317075.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:42:50] [INFO ] Decomposing Gal with order
[2024-06-02 20:42:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:42:50] [INFO ] Removed a total of 478 redundant transitions.
[2024-06-02 20:42:50] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:42:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 9 ms.
[2024-06-02 20:42:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2259860908077178720.gal : 3 ms
[2024-06-02 20:42:50] [INFO ] Time to serialize properties into /tmp/CTLFireability562944377475812641.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/CTLFireability2259860908077178720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability562944377475812641.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,5.70761e+06,2.35155,78464,1297,180,90106,2576,586,531259,89,22011,0


Converting to forward existential form...Done !
original formula: E((EG((AF(((i6.u3.p11==1)&&(i1.u13.p48==1))) * A(((i0.u0.p3==1)&&(i0.u25.p78==1)) U ((i1.u1.p4==1)&&(i3.u18.p57==1))))) + AF(!(AG((((i6.u...257
=> equivalent forward existential formula: [(FwdU(Init,(EG((!(EG(!(((i6.u3.p11==1)&&(i1.u13.p48==1))))) * !((E(!(((i1.u1.p4==1)&&(i3.u18.p57==1))) U (!(((i...420
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t44, t47, t48, t50, t58, t63, t67, t68, t73, t78, t86, t90, t91, t92, t93, t96,...830
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 106 transition count 288
Applied a total of 38 rules in 38 ms. Remains 106 /124 variables (removed 18) and now considering 288/332 (removed 44) transitions.
[2024-06-02 20:43:20] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 106 cols
[2024-06-02 20:43:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:43:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 20:43:20] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:43:20] [INFO ] Invariant cache hit.
[2024-06-02 20:43:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:43:20] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 20:43:20] [INFO ] Redundant transitions in 2 ms returned []
Running 287 sub problems to find dead transitions.
[2024-06-02 20:43:20] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:43:20] [INFO ] Invariant cache hit.
[2024-06-02 20:43:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:43:21] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:43:21] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:43:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:43:23] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 261/367 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 287 unsolved in 8817 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/367 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 287/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 448 constraints, problems are : Problem set: 0 solved, 287 unsolved in 23217 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 9/9 constraints]
After SMT, in 32180ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 32183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/124 places, 288/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32578 ms. Remains : 106/124 places, 288/332 transitions.
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:43:52] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:43:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8337207332543758891.gal : 2 ms
[2024-06-02 20:43:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16524241611453649592.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/CTLFireability8337207332543758891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16524241611453649592.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,5.32702e+06,5.22298,134836,2,6465,5,350697,6,0,711,484327,0


Converting to forward existential form...Done !
original formula: AF(AG((AG(((p6==0)||(p60==0))) + AG(((p10==0)||(p18==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(((p6==0)||(p60==0))))) + !(E(TRUE U !(((p10==0)||(p18==0)))))))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...606
Detected timeout of ITS tools.
[2024-06-02 20:44:22] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:44:22] [INFO ] Applying decomposition
[2024-06-02 20:44:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5013042231893729104.txt' '-o' '/tmp/graph5013042231893729104.bin' '-w' '/tmp/graph5013042231893729104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5013042231893729104.bin' '-l' '-1' '-v' '-w' '/tmp/graph5013042231893729104.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:44:22] [INFO ] Decomposing Gal with order
[2024-06-02 20:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:44:22] [INFO ] Removed a total of 440 redundant transitions.
[2024-06-02 20:44:22] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 8 ms.
[2024-06-02 20:44:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17780124749467553224.gal : 2 ms
[2024-06-02 20:44:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15449106205074445436.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/CTLFireability17780124749467553224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15449106205074445436.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.32702e+06,15.4111,397172,1615,179,491981,25028,654,2.75539e+06,85,131678,0


Converting to forward existential form...Done !
original formula: AF(AG((AG(((i6.i1.u35.p6==0)||(i2.u18.p60==0))) + AG(((i4.i1.u3.p10==0)||(i4.i0.u6.p18==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(((i6.i1.u35.p6==0)||(i2.u18.p60==0))))) + !(E(TRUE U !(((i4.i1.u3.p10==0...194
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t48, t49, t51, t57, t59, t73, t82, t94, t99, t136, t137, t138, t140, t142, t164, t1...853
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 314
Applied a total of 16 rules in 18 ms. Remains 116 /124 variables (removed 8) and now considering 314/332 (removed 18) transitions.
[2024-06-02 20:44:52] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 116 cols
[2024-06-02 20:44:52] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:44:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:44:53] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:44:53] [INFO ] Invariant cache hit.
[2024-06-02 20:44:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:44:53] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 20:44:53] [INFO ] Redundant transitions in 1 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 20:44:53] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:44:53] [INFO ] Invariant cache hit.
[2024-06-02 20:44:53] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:44:54] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:44:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:44:55] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-06-02 20:44:55] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:44:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:44:55] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 287/402 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 1/403 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 177 constraints, problems are : Problem set: 0 solved, 311 unsolved in 11746 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 287/402 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 311/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 488 constraints, problems are : Problem set: 0 solved, 311 unsolved in 22697 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 12/12 constraints]
After SMT, in 34625ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 34629ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/124 places, 314/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34881 ms. Remains : 116/124 places, 314/332 transitions.
[2024-06-02 20:45:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:45:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:45:27] [INFO ] Input system was already deterministic with 314 transitions.
[2024-06-02 20:45:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:45:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15153536231574385667.gal : 1 ms
[2024-06-02 20:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality962567179433464507.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/ReachabilityCardinality15153536231574385667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality962567179433464507.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
RANDOM walk for 40000 steps (2331 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality962567179433464507.prop.
BEST_FIRST walk for 40003 steps (588 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
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 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 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 50
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50 after 122
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :122 after 382
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :382 after 5140
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5140 after 7839
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7839 after 24825
Invariant property FireWire-PT-07-CTLFireability-2024-06 does not hold.
FORMULA FireWire-PT-07-CTLFireability-2024-06 FALSE 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 2049 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,4.28904e+06,0.491958,20324,2,2161,17,62729,6,0,777,55047,0
Total reachable state count : 4289042

Verifying 1 reachability properties.
Invariant property FireWire-PT-07-CTLFireability-2024-06 does not hold.

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-07-CTLFireability-2024-06,1155,0.492765,20324,2,247,17,62729,7,0,783,55047,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 1931260 steps, run timeout after 3001 ms. (steps per millisecond=643 ) properties seen :0 out of 1
Probabilistic random walk after 1931260 steps, saw 359055 distinct states, run finished after 3001 ms. (steps per millisecond=643 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 10 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
[2024-06-02 20:45:31] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 20:45:31] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 20:45:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:45:31] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:45:31] [INFO ] Invariant cache hit.
[2024-06-02 20:45:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:45:31] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:45:31] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:45:31] [INFO ] Invariant cache hit.
[2024-06-02 20:45:31] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:45:32] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:45:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22296 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32832ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32836ms
Starting structural reductions in LTL mode, iteration 1 : 106/124 places, 287/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33085 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 20:46:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:46:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:04] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:46:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17889871038515416243.gal : 1 ms
[2024-06-02 20:46:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4136830153128319320.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/CTLFireability17889871038515416243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4136830153128319320.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,6.23367e+06,5.95463,169452,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: E(EX(AX(E(((p11==1)&&(p124==1)) U !(((p8==1)&&(p97==1)))))) U E((AX(EX(((p8==1)&&(p110==1)))) + ((A(!(((p11==1)&&(p124==1))) U AX((p31==1...281
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EX(!(EX(!(E(((p11==1)&&(p124==1)) U !(((p8==1)&&(p97==1))))))))),(!(EX(!(EX(((p8==1)&&(p110==1...695
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
(forward)formula 0,0,8.64279,171028,1,0,515,585794,607,262,6124,596611,586
FORMULA FireWire-PT-07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 115 transition count 311
Applied a total of 18 rules in 21 ms. Remains 115 /124 variables (removed 9) and now considering 311/332 (removed 21) transitions.
[2024-06-02 20:46:12] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 115 cols
[2024-06-02 20:46:12] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:46:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:46:12] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 20:46:12] [INFO ] Invariant cache hit.
[2024-06-02 20:46:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:46:13] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-02 20:46:13] [INFO ] Redundant transitions in 2 ms returned []
Running 308 sub problems to find dead transitions.
[2024-06-02 20:46:13] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 20:46:13] [INFO ] Invariant cache hit.
[2024-06-02 20:46:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:46:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:46:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2024-06-02 20:46:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:46:15] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:46:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 284/398 variables, 114/133 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:46:23] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/399 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/400 variables, and 175 constraints, problems are : Problem set: 0 solved, 308 unsolved in 16701 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 284/398 variables, 114/134 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 40/174 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 308/482 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/400 variables, and 483 constraints, problems are : Problem set: 0 solved, 308 unsolved in 20882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 12/12 constraints]
After SMT, in 37767ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 37772ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/124 places, 311/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38078 ms. Remains : 115/124 places, 311/332 transitions.
[2024-06-02 20:46:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:50] [INFO ] Input system was already deterministic with 311 transitions.
[2024-06-02 20:46:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:46:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:50] [INFO ] Time to serialize gal into /tmp/CTLFireability728343241970185343.gal : 2 ms
[2024-06-02 20:46:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1434052447710074790.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/CTLFireability728343241970185343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1434052447710074790.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,5.4273e+06,0.797134,28412,2,2191,5,88850,6,0,770,89603,0


Converting to forward existential form...Done !
original formula: EF((((p4==1)&&(p42==1)) * (((AG(((p9==1)&&(p76==1))) + ((p8==1)&&(p98==1))) + ((p10==1)&&(p44==1))) * ((p3==0)||(p76==0)))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((p4==1)&&(p42==1))) * ((p3==0)||(p76==0))) * !(E(TRUE U !(((p9==1)&&(p76==1))))))] != F...364
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...666
(forward)formula 0,0,2.13895,55272,1,0,571,247501,645,291,6403,218395,636
FORMULA FireWire-PT-07-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Applied a total of 24 rules in 10 ms. Remains 113 /124 variables (removed 11) and now considering 303/332 (removed 29) transitions.
[2024-06-02 20:46:53] [INFO ] Flow matrix only has 277 transitions (discarded 26 similar events)
// Phase 1: matrix 277 rows 113 cols
[2024-06-02 20:46:53] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:46:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:46:53] [INFO ] Flow matrix only has 277 transitions (discarded 26 similar events)
[2024-06-02 20:46:53] [INFO ] Invariant cache hit.
[2024-06-02 20:46:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:46:53] [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 302 sub problems to find dead transitions.
[2024-06-02 20:46:53] [INFO ] Flow matrix only has 277 transitions (discarded 26 similar events)
[2024-06-02 20:46:53] [INFO ] Invariant cache hit.
[2024-06-02 20:46:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:46:54] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:46:54] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:46:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 276/389 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 172 constraints, problems are : Problem set: 0 solved, 302 unsolved in 11794 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 276/389 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 302/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:47:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:47:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 476 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 13/13 constraints]
After SMT, in 42027ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 42031ms
Starting structural reductions in LTL mode, iteration 1 : 113/124 places, 303/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42248 ms. Remains : 113/124 places, 303/332 transitions.
[2024-06-02 20:47:35] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:47:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:35] [INFO ] Input system was already deterministic with 303 transitions.
[2024-06-02 20:47:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16174878137498202293.gal : 1 ms
[2024-06-02 20:47:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14379949541905503188.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/CTLFireability16174878137498202293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14379949541905503188.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,6.30192e+06,1.12542,44776,2,2561,5,158934,6,0,754,147980,0


Converting to forward existential form...Done !
original formula: EF((E(EX(((p3==1)&&(p120==1))) U !((((((p5==1)&&(p107==1))&&((p10==1)&&(p121==1)))&&((p67==1)&&(p87==1)))||(p10==1)))) * EX((((((EG(((p8=...314
=> equivalent forward existential formula: (([FwdG((((EY((FwdU(Init,TRUE) * E(EX(((p3==1)&&(p120==1))) U !((((((p5==1)&&(p107==1))&&((p10==1)&&(p121==1)))&...816
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...649
(forward)formula 0,0,2.27096,56656,1,0,563,259061,638,289,6324,248988,627
FORMULA FireWire-PT-07-CTLFireability-2024-09 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 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Applied a total of 14 rules in 2 ms. Remains 118 /124 variables (removed 6) and now considering 316/332 (removed 16) transitions.
[2024-06-02 20:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2024-06-02 20:47:37] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:47:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:47:37] [INFO ] Invariant cache hit.
[2024-06-02 20:47:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:47:37] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 20:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:47:37] [INFO ] Invariant cache hit.
[2024-06-02 20:47:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:47:39] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:47:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:47:39] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:47:39] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:47:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:47:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:47:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:47:40] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 177 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 315/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 1/408 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 492 constraints, problems are : Problem set: 0 solved, 315 unsolved in 24506 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 8/8 constraints]
After SMT, in 37151ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 37155ms
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 316/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37405 ms. Remains : 118/124 places, 316/332 transitions.
[2024-06-02 20:48:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:15] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 20:48:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:15] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:48:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10786648228844625102.gal : 2 ms
[2024-06-02 20:48:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11940085793868845869.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/CTLFireability10786648228844625102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11940085793868845869.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,6.3511e+06,0.505859,21056,2,2375,5,63574,6,0,787,54241,0


Converting to forward existential form...Done !
original formula: (EG(((AX((((p64==0)||(p69==0)) * !(E(((p8==1)&&(p28==1)) U ((p6==1)&&(p110==1)))))) + EG(((p53==0)&&((p7==0)||(p110==0))))) + ((p8==0)||(...251
=> equivalent forward existential formula: ([(Init * !(EG(((!(EX(!((((p64==0)||(p69==0)) * !(E(((p8==1)&&(p28==1)) U ((p6==1)&&(p110==1)))))))) + EG(((p53=...372
(forward)formula 0,0,0.507763,21056,1,0,8,63574,9,2,798,54241,1
FORMULA FireWire-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Applied a total of 36 rules in 12 ms. Remains 107 /124 variables (removed 17) and now considering 289/332 (removed 43) transitions.
[2024-06-02 20:48:15] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
// Phase 1: matrix 263 rows 107 cols
[2024-06-02 20:48:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:48:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:48:15] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 20:48:15] [INFO ] Invariant cache hit.
[2024-06-02 20:48:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:48:15] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-06-02 20:48:15] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 20:48:15] [INFO ] Invariant cache hit.
[2024-06-02 20:48:15] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:48:17] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:48:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 262/369 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/370 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 160 constraints, problems are : Problem set: 0 solved, 288 unsolved in 10537 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 262/369 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 288/447 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/370 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-02 20:48:39] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/370 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 12 (OVERLAPS) 0/370 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 449 constraints, problems are : Problem set: 0 solved, 288 unsolved in 24472 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 8/8 constraints]
After SMT, in 35160ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 35166ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 289/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35436 ms. Remains : 107/124 places, 289/332 transitions.
[2024-06-02 20:48:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:48:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:51] [INFO ] Input system was already deterministic with 289 transitions.
[2024-06-02 20:48:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8506692143775383208.gal : 2 ms
[2024-06-02 20:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5835726728833768327.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/CTLFireability8506692143775383208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5835726728833768327.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,6.24282e+06,7.33976,176092,2,6452,5,490226,6,0,716,595447,0


Converting to forward existential form...Done !
original formula: AX((((E(EF(((p4==1)&&(p123==1))) U A(((p64==1)&&(p94==1)) U ((p7==1)&&(p108==1)))) * (p8==1)) * ((p107==1) * ((EX(AX(((p66==1)&&(p103==1)...457
=> equivalent forward existential formula: (([((EY(Init) * !(((E(TRUE U (!(E(TRUE U !(((p12==1)&&(p53==1))))) * EX((p53==1)))) * E(E(TRUE U ((p66==1)&&(p10...1797
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2024-06-02 20:49:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:21] [INFO ] Applying decomposition
[2024-06-02 20:49:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13908619238716228295.txt' '-o' '/tmp/graph13908619238716228295.bin' '-w' '/tmp/graph13908619238716228295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13908619238716228295.bin' '-l' '-1' '-v' '-w' '/tmp/graph13908619238716228295.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:49:21] [INFO ] Decomposing Gal with order
[2024-06-02 20:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:49:21] [INFO ] Removed a total of 444 redundant transitions.
[2024-06-02 20:49:21] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 5 ms.
[2024-06-02 20:49:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5771605353368864032.gal : 2 ms
[2024-06-02 20:49:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2277868853576986403.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/CTLFireability5771605353368864032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2277868853576986403.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.24282e+06,2.19632,77872,1310,88,121301,880,607,372200,79,4230,0


Converting to forward existential form...Done !
original formula: AX((((E(EF(((i1.i0.u1.p4==1)&&(i1.i1.u3.p123==1))) U A(((i4.u20.p64==1)&&(i4.u23.p94==1)) U ((i2.u2.p7==1)&&(i6.i1.u36.p108==1)))) * (i2....708
=> equivalent forward existential formula: (([((EY(Init) * !(((E(TRUE U (!(E(TRUE U !(((i1.i1.u3.p12==1)&&(i3.u18.p53==1))))) * EX((i3.u18.p53==1)))) * E(E...2590
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...786
(forward)formula 0,0,12.7,342396,1,0,524745,1949,3112,1.76101e+06,310,8684,1054786
FORMULA FireWire-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 8 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
[2024-06-02 20:49:34] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 20:49:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:49:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:49:34] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:49:34] [INFO ] Invariant cache hit.
[2024-06-02 20:49:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:49:34] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:49:34] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:49:34] [INFO ] Invariant cache hit.
[2024-06-02 20:49:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:49:35] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:49:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:49:35] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:49:35] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:49:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10424 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32518ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32522ms
Starting structural reductions in LTL mode, iteration 1 : 106/124 places, 287/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32734 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 20:50:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:06] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:50:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:50:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6849117007324002806.gal : 1 ms
[2024-06-02 20:50:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18398164362363060256.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/CTLFireability6849117007324002806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18398164362363060256.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,6.23367e+06,6.63276,169532,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EF((EX(((p8==1)&&(p109==1))) * (p54==0)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p54==0))) * ((p8==1)&&(p109==1)))] != FALSE
(forward)formula 0,1,6.82257,169532,1,0,9,456345,9,2,1321,596611,3
FORMULA FireWire-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 104 transition count 285
Applied a total of 40 rules in 31 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
[2024-06-02 20:50:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 104 cols
[2024-06-02 20:50:13] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 20:50:13] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:50:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:50:13] [INFO ] Invariant cache hit.
[2024-06-02 20:50:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:50:14] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-02 20:50:14] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 20:50:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:50:14] [INFO ] Invariant cache hit.
[2024-06-02 20:50:14] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:50:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:50:14] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:50:15] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:50:16] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:50:16] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:50:16] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 258/361 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 162 constraints, problems are : Problem set: 0 solved, 282 unsolved in 11233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/363 variables, and 444 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12417 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints]
After SMT, in 23814ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 23818ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/124 places, 285/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24062 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 20:50:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:50:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:50:37] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:50:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:50:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16017554625916330907.gal : 1 ms
[2024-06-02 20:50:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2421031865196014681.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/CTLFireability16017554625916330907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2421031865196014681.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,5.1877e+06,3.69581,105832,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EG(EF((p100==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p100==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2024-06-02 20:51:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:51:07] [INFO ] Applying decomposition
[2024-06-02 20:51:07] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10500865481522398162.txt' '-o' '/tmp/graph10500865481522398162.bin' '-w' '/tmp/graph10500865481522398162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10500865481522398162.bin' '-l' '-1' '-v' '-w' '/tmp/graph10500865481522398162.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:51:07] [INFO ] Decomposing Gal with order
[2024-06-02 20:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:51:08] [INFO ] Removed a total of 435 redundant transitions.
[2024-06-02 20:51:08] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 3 ms.
[2024-06-02 20:51:08] [INFO ] Time to serialize gal into /tmp/CTLFireability449103923741639304.gal : 2 ms
[2024-06-02 20:51:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13446808528318773658.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/CTLFireability449103923741639304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13446808528318773658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1877e+06,8.18854,242484,2898,122,243474,975,523,1.9411e+06,80,9005,0


Converting to forward existential form...Done !
original formula: EG(EF((i6.u35.p100==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i6.u35.p100==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t59, t64, t69, t74, t79, t81, t90, t91, t92, t94, t99, t139, t14...756
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 104 transition count 285
Applied a total of 40 rules in 31 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
[2024-06-02 20:51:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:51:38] [INFO ] Invariant cache hit.
[2024-06-02 20:51:38] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:51:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:51:38] [INFO ] Invariant cache hit.
[2024-06-02 20:51:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:51:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:51:38] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 20:51:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:51:38] [INFO ] Invariant cache hit.
[2024-06-02 20:51:38] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:51:39] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:51:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:51:40] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:51:40] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:51:40] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 20:51:41] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 258/361 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 162 constraints, problems are : Problem set: 0 solved, 282 unsolved in 11214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/363 variables, and 444 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints]
After SMT, in 23544ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 23546ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/124 places, 285/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23826 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 20:52:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:52:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:01] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:52:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:01] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4594703348838865165.gal : 1 ms
[2024-06-02 20:52:01] [INFO ] Time to serialize properties into /tmp/CTLFireability890371466328914358.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/CTLFireability4594703348838865165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability890371466328914358.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,5.1877e+06,3.62829,105580,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EF(AG(((p5==1)&&(p107==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p5==1)&&(p107==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
(forward)formula 0,0,6.09456,113764,1,0,508,505826,589,259,5939,444116,577
FORMULA FireWire-PT-07-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 324
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 295
Applied a total of 31 rules in 15 ms. Remains 109 /124 variables (removed 15) and now considering 295/332 (removed 37) transitions.
[2024-06-02 20:52:08] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 109 cols
[2024-06-02 20:52:08] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:08] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 20:52:08] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:52:08] [INFO ] Invariant cache hit.
[2024-06-02 20:52:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:52:08] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 20:52:08] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:52:08] [INFO ] Invariant cache hit.
[2024-06-02 20:52:08] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:52:09] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:52:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:52:09] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:52:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 166 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 294/459 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 460 constraints, problems are : Problem set: 0 solved, 294 unsolved in 18761 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 10/10 constraints]
After SMT, in 29848ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 29855ms
Starting structural reductions in LTL mode, iteration 1 : 109/124 places, 295/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30117 ms. Remains : 109/124 places, 295/332 transitions.
[2024-06-02 20:52:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:38] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 20:52:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10848153670403929961.gal : 2 ms
[2024-06-02 20:52:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4921245057472680108.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/CTLFireability10848153670403929961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4921245057472680108.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,6.95698e+06,6.41334,174280,2,6411,5,474286,6,0,730,600873,0


Converting to forward existential form...Done !
original formula: (E(!(AF(!(E(((p3==1)&&(p56==1)) U ((p6==1)&&(p51==1)))))) U ((p8==1)&&(p53==1))) + (AF(AG(((p3==0)||(p43==0)))) * EX(((p53==0)||((p11==1)...170
=> equivalent forward existential formula: ([FwdG((Init * !(E(!(!(EG(!(!(E(((p3==1)&&(p56==1)) U ((p6==1)&&(p51==1)))))))) U ((p8==1)&&(p53==1))))),!(!(E(T...351
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:53:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:53:08] [INFO ] Applying decomposition
[2024-06-02 20:53:08] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5258494538760778803.txt' '-o' '/tmp/graph5258494538760778803.bin' '-w' '/tmp/graph5258494538760778803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5258494538760778803.bin' '-l' '-1' '-v' '-w' '/tmp/graph5258494538760778803.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:53:08] [INFO ] Decomposing Gal with order
[2024-06-02 20:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:53:08] [INFO ] Removed a total of 435 redundant transitions.
[2024-06-02 20:53:08] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:53:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 3 ms.
[2024-06-02 20:53:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14708087772383051875.gal : 4 ms
[2024-06-02 20:53:08] [INFO ] Time to serialize properties into /tmp/CTLFireability17109082339520084784.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/CTLFireability14708087772383051875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17109082339520084784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:53:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:53:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:53:38] [INFO ] Applying decomposition
[2024-06-02 20:53:38] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1163236316449323935.txt' '-o' '/tmp/graph1163236316449323935.bin' '-w' '/tmp/graph1163236316449323935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1163236316449323935.bin' '-l' '-1' '-v' '-w' '/tmp/graph1163236316449323935.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:53:38] [INFO ] Decomposing Gal with order
[2024-06-02 20:53:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:53:38] [INFO ] Removed a total of 511 redundant transitions.
[2024-06-02 20:53:38] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:53:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 4 ms.
[2024-06-02 20:53:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1872561210679891102.gal : 2 ms
[2024-06-02 20:53:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12479210199611775304.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/CTLFireability1872561210679891102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12479210199611775304.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.8607e+06,3.9674,103936,2485,174,143235,1281,620,459741,94,8264,0


Converting to forward existential form...Done !
original formula: EF((A(!((A(((i2.u3.p10==1)&&(i0.u39.p119==1)) U ((i0.u0.p3==1)&&(i3.u11.p17==1))) + ((i7.i0.u33.p6==1)&&(i4.u18.p54==1)))) U EG(((((i2.u3...324
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(!(EG(((((i2.u3.p10==1)&&(i2.u26.p85==1))||((i2.u3.p10==1)&&(i6.u29.p93==1))) * EG(((...2022
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t69, t74, t78, t79, t87, t94, t97, t99, t136, t13...894
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,38.9038,909804,1,0,1.13408e+06,5689,3396,4.84794e+06,448,38753,2532883
FORMULA FireWire-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((EG((AF(((i2.u3.p11==1)&&(i1.u15.p48==1))) * A(((i0.u0.p3==1)&&(i0.u23.p78==1)) U ((i1.u1.p4==1)&&(i4.u19.p57==1))))) + AF(!(AG((((i2.u...257
=> equivalent forward existential formula: [(FwdU(Init,(EG((!(EG(!(((i2.u3.p11==1)&&(i1.u15.p48==1))))) * !((E(!(((i1.u1.p4==1)&&(i4.u19.p57==1))) U (!(((i...420
(forward)formula 1,1,63.1612,1485788,1,0,1.88178e+06,6243,3958,7.29086e+06,468,44642,4300805
FORMULA FireWire-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG((AG(((i7.i0.u33.p6==0)||(i4.u18.p60==0))) + AG(((i2.u3.p10==0)||(i2.u6.p18==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(((i7.i0.u33.p6==0)||(i4.u18.p60==0))))) + !(E(TRUE U !(((i2.u3.p10==0)||...188
(forward)formula 2,0,127.477,2216540,1,0,2.88499e+06,6572,1485,1.03392e+07,211,51484,1820054
FORMULA FireWire-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((i7.i1.u41.p100==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i7.i1.u41.p100==1)))] != FALSE
(forward)formula 3,1,154.332,2216540,1,0,2.88499e+06,6572,2101,1.03392e+07,245,51484,4298213
FORMULA FireWire-PT-07-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(!(AF(!(E(((i0.u0.p3==1)&&(i4.u18.p56==1)) U ((i7.i0.u33.p6==1)&&(i4.u17.p51==1)))))) U ((i3.u2.p8==1)&&(i4.u18.p53==1))) + (AF(AG(((i0...245
=> equivalent forward existential formula: ([FwdG((Init * !(E(!(!(EG(!(!(E(((i0.u0.p3==1)&&(i4.u18.p56==1)) U ((i7.i0.u33.p6==1)&&(i4.u17.p51==1)))))))) U ...469
Fast SCC detection found a local SCC at level 7
(forward)formula 4,0,191.355,2367284,1,0,2.998e+06,6572,2294,1.12169e+07,254,51484,6578492
FORMULA FireWire-PT-07-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1717361810265

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

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