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

About the Execution of ITS-Tools for FireWire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2985.867 1209697.00 1320841.00 3093.80 TFTTFTTFFTTTFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898800210.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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-06-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360344170

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:32:25] [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:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:32:25] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 20:32:25] [INFO ] Transformed 116 places.
[2024-06-02 20:32:25] [INFO ] Transformed 368 transitions.
[2024-06-02 20:32:25] [INFO ] Found NUPN structural information;
[2024-06-02 20:32:25] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 71 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 115 transition count 304
Applied a total of 8 rules in 28 ms. Remains 115 /116 variables (removed 1) and now considering 304/312 (removed 8) transitions.
[2024-06-02 20:32:25] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 20:32:25] [INFO ] Computed 9 invariants in 19 ms
[2024-06-02 20:32:25] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-02 20:32:25] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:32:25] [INFO ] Invariant cache hit.
[2024-06-02 20:32:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:32:26] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 451 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 113/116 places, 304/312 transitions.
Support contains 71 out of 113 places after structural reductions.
[2024-06-02 20:32:26] [INFO ] Flatten gal took : 47 ms
[2024-06-02 20:32:26] [INFO ] Flatten gal took : 29 ms
[2024-06-02 20:32:26] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (2003 resets) in 1516 ms. (26 steps per ms) remains 43/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (55 resets) in 37 ms. (105 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (58 resets) in 39 ms. (100 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (118 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (123 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (116 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (47 resets) in 32 ms. (121 steps per ms) remains 35/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (47 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (106 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (82 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (34 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (59 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (23 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (80 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (91 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (78 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (81 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (81 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
[2024-06-02 20:32:27] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:32:27] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:32:27] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/104 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/111 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 4 solved, 29 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 29 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/104 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 28 unsolved
[2024-06-02 20:32:28] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 8 ms to minimize.
[2024-06-02 20:32:28] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:32:28] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:32:28] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/9 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 7/111 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 277/388 variables, 111/122 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 40/162 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 22/184 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/186 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 6/192 constraints. Problems are: Problem set: 5 solved, 28 unsolved
[2024-06-02 20:32:30] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:32:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:32:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 3/195 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 1/391 variables, 1/196 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/196 constraints. Problems are: Problem set: 5 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/391 variables, 0/196 constraints. Problems are: Problem set: 5 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 196 constraints, problems are : Problem set: 5 solved, 28 unsolved in 3747 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 28/33 constraints, Known Traps: 7/7 constraints]
After SMT, in 4950ms problems are : Problem set: 5 solved, 28 unsolved
Parikh walk visited 0 properties in 2559 ms.
Support contains 37 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 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 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 109 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 109 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 109 transition count 295
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 109 transition count 318
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 107 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 33 place count 107 transition count 305
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 107 transition count 305
Applied a total of 35 rules in 76 ms. Remains 107 /113 variables (removed 6) and now considering 305/304 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 107/113 places, 305/304 transitions.
RANDOM walk for 40000 steps (2117 resets) in 911 ms. (43 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (155 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (125 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (103 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (65 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (64 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (19 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (110 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (105 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (65 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (104 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (9 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (97 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
[2024-06-02 20:32:35] [INFO ] Flow matrix only has 281 transitions (discarded 24 similar events)
// Phase 1: matrix 281 rows 107 cols
[2024-06-02 20:32:35] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:32:35] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 66/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 5/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 281/386 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 2/388 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 157 constraints, problems are : Problem set: 0 solved, 25 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 66/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:32:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:32:36] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:32:36] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:32:36] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 5/105 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:32:36] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 281/386 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 21/181 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 2/388 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:32:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:32:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 189 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2951 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 7/7 constraints]
After SMT, in 3719ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 0 properties in 3787 ms.
Support contains 34 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 305/305 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 107/107 places, 305/305 transitions.
RANDOM walk for 40000 steps (2142 resets) in 275 ms. (144 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (57 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (57 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (154 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (62 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (69 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (133 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (104 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (101 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (100 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (56 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (103 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (107 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 441976 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :6 out of 25
Probabilistic random walk after 441976 steps, saw 106049 distinct states, run finished after 3004 ms. (steps per millisecond=147 ) properties seen :6
[2024-06-02 20:32:45] [INFO ] Flow matrix only has 281 transitions (discarded 24 similar events)
[2024-06-02 20:32:45] [INFO ] Invariant cache hit.
[2024-06-02 20:32:45] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 74/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 281/386 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 43/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 2/388 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 157 constraints, problems are : Problem set: 0 solved, 19 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 74/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:32:46] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:32:46] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
[2024-06-02 20:32:46] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/105 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:46] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 281/386 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/388 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/388 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/388 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 183 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 7/7 constraints]
After SMT, in 3575ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 1061 ms.
Support contains 26 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 305/305 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 306
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 105 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 105 transition count 302
Applied a total of 8 rules in 21 ms. Remains 105 /107 variables (removed 2) and now considering 302/305 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 105/107 places, 302/305 transitions.
RANDOM walk for 40000 steps (2189 resets) in 239 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (53 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (151 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (57 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (124 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (108 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (22 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (54 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (111 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (63 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (106 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 495484 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 19
Probabilistic random walk after 495484 steps, saw 123283 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-02 20:32:53] [INFO ] Flow matrix only has 277 transitions (discarded 25 similar events)
// Phase 1: matrix 277 rows 105 cols
[2024-06-02 20:32:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:32:53] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 72/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 277/380 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/153 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 2/382 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 19 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 72/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/103 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 277/380 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 17/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/382 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:32:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:32:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/382 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 182 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 715 ms.
Support contains 26 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 302/302 transitions.
Applied a total of 0 rules in 21 ms. Remains 105 /105 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 105/105 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 20:32:57] [INFO ] Flow matrix only has 277 transitions (discarded 25 similar events)
[2024-06-02 20:32:57] [INFO ] Invariant cache hit.
[2024-06-02 20:32:57] [INFO ] Implicit Places using invariants in 57 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 302/302 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 301
Applied a total of 2 rules in 9 ms. Remains 103 /104 variables (removed 1) and now considering 301/302 (removed 1) transitions.
[2024-06-02 20:32:57] [INFO ] Flow matrix only has 276 transitions (discarded 25 similar events)
// Phase 1: matrix 276 rows 103 cols
[2024-06-02 20:32:57] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:32:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:32:57] [INFO ] Flow matrix only has 276 transitions (discarded 25 similar events)
[2024-06-02 20:32:57] [INFO ] Invariant cache hit.
[2024-06-02 20:32:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:32:57] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/105 places, 301/302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 280 ms. Remains : 103/105 places, 301/302 transitions.
RANDOM walk for 40000 steps (2344 resets) in 222 ms. (179 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (61 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (176 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (158 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (121 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (62 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (55 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (128 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (117 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
Probabilistic random walk after 1000001 steps, saw 199093 distinct states, run finished after 2912 ms. (steps per millisecond=343 ) properties seen :17
[2024-06-02 20:33:00] [INFO ] Flow matrix only has 276 transitions (discarded 25 similar events)
[2024-06-02 20:33:00] [INFO ] Invariant cache hit.
[2024-06-02 20:33:00] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 276/377 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/379 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:33:00] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:33:01] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:33:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:33:01] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 276/377 variables, 101/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/379 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:33:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 301/301 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 306
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 303
Applied a total of 5 rules in 18 ms. Remains 102 /103 variables (removed 1) and now considering 303/301 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 102/103 places, 303/301 transitions.
RANDOM walk for 40000 steps (2322 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (658 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1677018 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :1 out of 2
Probabilistic random walk after 1677018 steps, saw 369213 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :1
[2024-06-02 20:33:04] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
// Phase 1: matrix 276 rows 102 cols
[2024-06-02 20:33:04] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 20:33:04] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/376 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 42/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/378 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:33:04] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 276/376 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/378 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:33:04] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 303/303 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 303/303 transitions.
RANDOM walk for 40000 steps (2253 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (660 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1904316 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :0 out of 1
Probabilistic random walk after 1904316 steps, saw 416472 distinct states, run finished after 3003 ms. (steps per millisecond=634 ) properties seen :0
[2024-06-02 20:33:08] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
[2024-06-02 20:33:08] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/376 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 42/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/378 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:33:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 276/376 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/378 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:33:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 102/102 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 303/303 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-06-02 20:33:08] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
[2024-06-02 20:33:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:33:08] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
[2024-06-02 20:33:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:33:08] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 20:33:08] [INFO ] Redundant transitions in 18 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 20:33:08] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 20:33:08] [INFO ] Invariant cache hit.
[2024-06-02 20:33:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:33:10] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:33:10] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:33:10] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:33:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:33:11] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 276/378 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:33:16] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2024-06-02 20:33:16] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/378 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 0 solved, 302 unsolved in 13772 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 276/378 variables, 102/115 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 42/157 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 302/459 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:33:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 20:33:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 461 constraints, problems are : Problem set: 0 solved, 302 unsolved in 23252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints]
After SMT, in 37232ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 37237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37481 ms. Remains : 102/102 places, 303/303 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 102 vertex of which 23 / 102 are part of one of the 4 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 121 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 82 transition count 173
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 81 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 81 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 80 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 79 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 79 transition count 170
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 79 transition count 168
Free-agglomeration rule applied 3 times with reduction of 1 identical transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 79 transition count 164
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 27 place count 76 transition count 163
Applied a total of 27 rules in 30 ms. Remains 76 /102 variables (removed 26) and now considering 163/303 (removed 140) transitions.
Running SMT prover for 1 properties.
[2024-06-02 20:33:46] [INFO ] Flow matrix only has 162 transitions (discarded 1 similar events)
// Phase 1: matrix 162 rows 76 cols
[2024-06-02 20:33:46] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:33:46] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:33:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 20:33:46] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:33:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:33:46] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
TRAPS : Iteration 1
[2024-06-02 20:33:46] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:33:46] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 282 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:33:46] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:33:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:33:46] [INFO ] Input system was already deterministic with 304 transitions.
Support contains 66 out of 113 places (down from 67) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:33:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:33:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:33:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:33:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:33:46] [INFO ] Invariant cache hit.
[2024-06-02 20:33:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:33:46] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:33:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:33:46] [INFO ] Invariant cache hit.
[2024-06-02 20:33:46] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 2 ms to minimize.
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:33:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:33:49] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 13026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:34:00] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:34:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:34:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29090 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42327ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42333ms
Finished structural reductions in LTL mode , in 1 iterations and 42566 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:34:28] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:34:28] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:34:29] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:34:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:34:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:34:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14521406335963703934.gal : 7 ms
[2024-06-02 20:34:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12690027599544066095.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/CTLFireability14521406335963703934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12690027599544066095.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,5.56308e+06,2.5729,79236,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: (AF(((p6==1)&&(p29==1))) + A(EG(((p5==1)&&(p77==1))) U (E((!(AG(((p11==1)&&(p23==1)))) + ((p5==1)&&(p50==1))) U EX(((p4==1)&&(p23==1)))) ...168
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!((E((!(!(E(TRUE U !(((p11==1)&&(p23==1)))))) + ((p5==1)&&(p50==1))) U EX(((p4==1)&&(p23==1...467
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:34:59] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:34:59] [INFO ] Applying decomposition
[2024-06-02 20:34:59] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5500827476608973519.txt' '-o' '/tmp/graph5500827476608973519.bin' '-w' '/tmp/graph5500827476608973519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5500827476608973519.bin' '-l' '-1' '-v' '-w' '/tmp/graph5500827476608973519.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:34:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:34:59] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:34:59] [INFO ] Flatten gal took : 126 ms
[2024-06-02 20:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 27 ms.
[2024-06-02 20:34:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15001537551925405708.gal : 5 ms
[2024-06-02 20:34:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8355729701941910908.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/CTLFireability15001537551925405708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8355729701941910908.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56308e+06,8.27824,187236,1891,198,231844,3225,606,1.04238e+06,87,28776,0


Converting to forward existential form...Done !
original formula: (AF(((i3.u2.p6==1)&&(i2.u10.p29==1))) + A(EG(((i2.u9.p5==1)&&(i4.u26.p77==1))) U (E((!(AG(((i1.i3.u3.p11==1)&&(i1.i1.u8.p23==1)))) + ((i2...250
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!((E((!(!(E(TRUE U !(((i1.i3.u3.p11==1)&&(i1.i1.u8.p23==1)))))) + ((i2.u9.p5==1)&&(i3.u16.p...661
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t50, t51, t59, t60, t65, t70, t75, t80, t94, t96, t136, t145, t150, t152, t153,...746
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,23.8897,433028,1,0,592925,10416,3175,2.16373e+06,390,65069,1259615
FORMULA FireWire-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:35:23] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:23] [INFO ] Invariant cache hit.
[2024-06-02 20:35:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 20:35:23] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:23] [INFO ] Invariant cache hit.
[2024-06-02 20:35:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:35:23] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:35:23] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:35:23] [INFO ] Invariant cache hit.
[2024-06-02 20:35:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:35:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:35:26] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12756 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:37] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:35:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42341ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42345ms
Finished structural reductions in LTL mode , in 1 iterations and 42626 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:36:06] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:36:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:36:06] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:36:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:36:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:36:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10955707108840469370.gal : 3 ms
[2024-06-02 20:36:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14966067393409520054.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/CTLFireability10955707108840469370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14966067393409520054.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,5.56308e+06,2.49107,79000,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: (EG((AG(((p7==0)||(p105==0))) * AX(!(A(((p6==1)&&(p90==1)) U ((p11==1)&&(p86==1))))))) + (EX(AX((AG((p82==1)) + A(((p8==1)&&(p40==1)) U (...313
=> equivalent forward existential formula: ([((Init * !(EG((!(E(TRUE U !(((p7==0)||(p105==0))))) * !(EX(!(!(!((E(!(((p11==1)&&(p86==1))) U (!(((p6==1)&&(p9...958
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:36:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:36:36] [INFO ] Applying decomposition
[2024-06-02 20:36:36] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3414995680067978466.txt' '-o' '/tmp/graph3414995680067978466.bin' '-w' '/tmp/graph3414995680067978466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3414995680067978466.bin' '-l' '-1' '-v' '-w' '/tmp/graph3414995680067978466.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:36:36] [INFO ] Decomposing Gal with order
[2024-06-02 20:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:36:36] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:36:36] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2024-06-02 20:36:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2559253342354557044.gal : 3 ms
[2024-06-02 20:36:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8001706627188350032.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/CTLFireability2559253342354557044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8001706627188350032.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.56308e+06,26.9318,610180,2508,226,469491,2645,608,5.54787e+06,87,29610,0


Converting to forward existential form...Done !
original formula: (EG((AG(((i3.u2.p7==0)||(i4.u35.p105==0))) * AX(!(A(((i3.u2.p6==1)&&(i5.u29.p90==1)) U ((i2.i0.u3.p11==1)&&(i4.u28.p86==1))))))) + (EX(AX...458
=> equivalent forward existential formula: ([((Init * !(EG((!(E(TRUE U !(((i3.u2.p7==0)||(i4.u35.p105==0))))) * !(EX(!(!(!((E(!(((i2.i0.u3.p11==1)&&(i4.u28...1307
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t50, t51, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99, t136, t145, t1...740
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 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Applied a total of 2 rules in 18 ms. Remains 112 /113 variables (removed 1) and now considering 303/304 (removed 1) transitions.
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 277 transitions (discarded 26 similar events)
// Phase 1: matrix 277 rows 112 cols
[2024-06-02 20:37:06] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:37:06] [INFO ] Implicit Places using invariants in 61 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/113 places, 303/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 302
Applied a total of 2 rules in 7 ms. Remains 110 /111 variables (removed 1) and now considering 302/303 (removed 1) transitions.
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 20:37:06] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:37:06] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 20:37:06] [INFO ] Invariant cache hit.
[2024-06-02 20:37:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:37:06] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 110/113 places, 302/304 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 323 ms. Remains : 110/113 places, 302/304 transitions.
[2024-06-02 20:37:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:37:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:37:06] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-02 20:37:06] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:37:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9393153017242047398.gal : 2 ms
[2024-06-02 20:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9336143619364708798.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/CTLFireability9393153017242047398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9336143619364708798.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,4.31719e+06,1.24801,43028,2,3376,5,96395,6,0,741,122103,0


Converting to forward existential form...Done !
original formula: E(A(((p74==1)&&(p24==1)) U (((AF(((p7==1)&&(p76==1))) + EF(((p7==1)&&(p105==1)))) + (!(((!(((p4==1)&&(p48==1))) * AG((p111==1))) + ((p3==...411
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((((!(EG(!(((p7==1)&&(p76==1))))) + E(TRUE U ((p7==1)&&(p105==1)))) + (!(((!(((p4==1)&&(p48==1...1238
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t7, t9, t14, t15, t16, t17, t19, t21, t26, t27, t28, t29, t31, t33, t38, t39, t40...564
Detected timeout of ITS tools.
[2024-06-02 20:37:36] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:37:36] [INFO ] Applying decomposition
[2024-06-02 20:37:36] [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/graph16843619187583883106.txt' '-o' '/tmp/graph16843619187583883106.bin' '-w' '/tmp/graph16843619187583883106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16843619187583883106.bin' '-l' '-1' '-v' '-w' '/tmp/graph16843619187583883106.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:37:37] [INFO ] Decomposing Gal with order
[2024-06-02 20:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:37:37] [INFO ] Removed a total of 457 redundant transitions.
[2024-06-02 20:37:37] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 7 ms.
[2024-06-02 20:37:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13836932075206034995.gal : 2 ms
[2024-06-02 20:37:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12131846907001849478.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/CTLFireability13836932075206034995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12131846907001849478.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,4.31719e+06,4.99807,142612,1893,137,200092,1731,602,885591,87,16015,0


Converting to forward existential form...Done !
original formula: E(A(((i6.u25.p74==1)&&(i1.u8.p24==1)) U (((AF(((i3.u2.p7==1)&&(i6.u26.p76==1))) + EF(((i3.u2.p7==1)&&(i6.u35.p105==1)))) + (!(((!(((i0.i0...634
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((((!(EG(!(((i3.u2.p7==1)&&(i6.u26.p76==1))))) + E(TRUE U ((i3.u2.p7==1)&&(i6.u35.p105==1)))) ...1843
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t48, t57, t77, t80, t91, t93, t94, t95, t96, t133, t142, t147, t164, t165, t16...714
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
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 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 22 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
[2024-06-02 20:38:07] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
// Phase 1: matrix 272 rows 107 cols
[2024-06-02 20:38:07] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:38:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:38:07] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:38:07] [INFO ] Invariant cache hit.
[2024-06-02 20:38:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:38:07] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 20:38:07] [INFO ] Redundant transitions in 5 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 20:38:07] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:38:07] [INFO ] Invariant cache hit.
[2024-06-02 20:38:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:38:08] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:38:08] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-06-02 20:38:08] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:38:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
[2024-06-02 20:38:08] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:38:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:38:09] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 271/378 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:38:12] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 158 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10436 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:38:18] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 271/378 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 455 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15267 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 11/11 constraints]
After SMT, in 25902ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25906ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/113 places, 297/304 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26134 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 20:38:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:38:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:38:33] [INFO ] Input system was already deterministic with 297 transitions.
[2024-06-02 20:38:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:38:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16152815162454985417.gal : 2 ms
[2024-06-02 20:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18082226026917279641.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/CTLFireability16152815162454985417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18082226026917279641.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,3.1337e+06,0.973664,35268,2,2756,5,83467,6,0,725,96587,0


Converting to forward existential form...Done !
original formula: (EF(((p10==1)&&(p78==1))) * A(!(AF(!(AF(((p2==1)&&(p94==1)))))) U !(((p2==1)&&(p102==1)))))
=> equivalent forward existential formula: [(((Init * E(TRUE U ((p10==1)&&(p78==1)))) * !(EG(!(!(((p2==1)&&(p102==1))))))) * !(E(!(!(((p2==1)&&(p102==1))))...250
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 20:39:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:39:03] [INFO ] Applying decomposition
[2024-06-02 20:39:03] [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/graph6791475488012601450.txt' '-o' '/tmp/graph6791475488012601450.bin' '-w' '/tmp/graph6791475488012601450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6791475488012601450.bin' '-l' '-1' '-v' '-w' '/tmp/graph6791475488012601450.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:39:03] [INFO ] Decomposing Gal with order
[2024-06-02 20:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:39:03] [INFO ] Removed a total of 448 redundant transitions.
[2024-06-02 20:39:03] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 6 ms.
[2024-06-02 20:39:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15088764293942830745.gal : 3 ms
[2024-06-02 20:39:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9435045907447385129.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/CTLFireability15088764293942830745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9435045907447385129.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 302
Applied a total of 4 rules in 9 ms. Remains 111 /113 variables (removed 2) and now considering 302/304 (removed 2) transitions.
[2024-06-02 20:39:33] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 20:39:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:39:33] [INFO ] Implicit Places using invariants in 50 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/113 places, 302/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 301
Applied a total of 2 rules in 6 ms. Remains 109 /110 variables (removed 1) and now considering 301/302 (removed 1) transitions.
[2024-06-02 20:39:33] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 109 cols
[2024-06-02 20:39:33] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:39:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:39:33] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 20:39:33] [INFO ] Invariant cache hit.
[2024-06-02 20:39:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:39:33] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 109/113 places, 301/304 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 262 ms. Remains : 109/113 places, 301/304 transitions.
[2024-06-02 20:39:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:39:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:39:33] [INFO ] Input system was already deterministic with 301 transitions.
[2024-06-02 20:39:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:39:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16370785698942636323.gal : 2 ms
[2024-06-02 20:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14440004875970132449.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/CTLFireability16370785698942636323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14440004875970132449.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,3.22242e+06,1.29309,43068,2,3374,5,96371,6,0,736,122085,0


Converting to forward existential form...Done !
original formula: EF(((!(A(((((p7==1)&&(p54==1))||(p12==1))||(((p49==1)&&(p62==1))||((p7==1)&&(p82==1)))) U !(((p3==1)&&(p72==1))))) * (p7==1)) * ((p60==1)...181
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * ((p60==1)&&((p88==0)||(p109==0)))) * (p7==1)),!(!(((p3==1)&&(p72==1))))) * (!(((((p7...380
Hit Full ! (commute/partial/dont) 264/35/37
(forward)formula 0,0,1.924,43372,1,0,15,157227,30,6,4167,122085,11
FORMULA FireWire-PT-06-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
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 10 place count 107 transition count 297
Applied a total of 10 rules in 22 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
// Phase 1: matrix 272 rows 107 cols
[2024-06-02 20:39:35] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 20:39:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:39:35] [INFO ] Invariant cache hit.
[2024-06-02 20:39:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:39:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 20:39:35] [INFO ] Redundant transitions in 4 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:39:35] [INFO ] Invariant cache hit.
[2024-06-02 20:39:35] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:39:36] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 271/378 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:39:40] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 158 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10399 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:39:47] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 271/378 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:39:51] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:39:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 455 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15203 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 11/11 constraints]
After SMT, in 25783ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25786ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/113 places, 297/304 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26025 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 20:40:01] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:40:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:40:01] [INFO ] Input system was already deterministic with 297 transitions.
[2024-06-02 20:40:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:40:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:40:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17198908049436282754.gal : 2 ms
[2024-06-02 20:40:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17815607468761287249.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/ReachabilityCardinality17198908049436282754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17815607468761287249.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2447 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (21 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality17815607468761287249.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 23
Finished probabilistic random walk after 16286 steps, run visited all 1 properties in 31 ms. (steps per millisecond=525 )
Probabilistic random walk after 16286 steps, saw 4981 distinct states, run finished after 34 ms. (steps per millisecond=479 ) properties seen :1
FORMULA FireWire-PT-06-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 19 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
[2024-06-02 20:40:01] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:40:01] [INFO ] Invariant cache hit.
[2024-06-02 20:40:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:40:01] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:40:02] [INFO ] Invariant cache hit.
[2024-06-02 20:40:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:40:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 20:40:02] [INFO ] Redundant transitions in 1 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 20:40:02] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:40:02] [INFO ] Invariant cache hit.
[2024-06-02 20:40:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:40:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:40:04] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 271/378 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:40:07] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 158 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:40:13] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 271/378 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:40:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 455 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15045 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 11/11 constraints]
After SMT, in 25786ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25789ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/113 places, 297/304 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26015 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 20:40:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:40:27] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:40:27] [INFO ] Input system was already deterministic with 297 transitions.
[2024-06-02 20:40:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:40:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:40:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8208973732086816460.gal : 1 ms
[2024-06-02 20:40:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5326419830529375074.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/CTLFireability8208973732086816460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5326419830529375074.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,3.1337e+06,1.04645,35184,2,2756,5,83467,6,0,725,96587,0


Converting to forward existential form...Done !
original formula: EF(EG(((p7==1)&&(p90==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p7==1)&&(p90==1)))] != FALSE
Hit Full ! (commute/partial/dont) 193/101/104
(forward)formula 0,1,1.57749,35708,1,0,8,135224,19,2,4286,96587,8
FORMULA FireWire-PT-06-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:40:29] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:40:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:40:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:40:29] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:40:29] [INFO ] Invariant cache hit.
[2024-06-02 20:40:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:40:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:40:29] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:40:29] [INFO ] Invariant cache hit.
[2024-06-02 20:40:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-06-02 20:40:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:40:32] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 13127 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:40:44] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:40:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:40:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 28913 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42230ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42238ms
Finished structural reductions in LTL mode , in 1 iterations and 42452 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:41:12] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:41:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:41:12] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:41:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:41:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:41:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10389587669739323137.gal : 1 ms
[2024-06-02 20:41:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13835007740803650559.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/CTLFireability10389587669739323137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13835007740803650559.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,5.56308e+06,2.66986,79212,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: (A(AX(!((((!((p8==1)&&(p96==1)))&&(p7==1))&&(p77==1)))) U !((AX(AX((p78==1))) + EF(EX(((p2==1)&&(p92==1))))))) + E(!((!(AG(!(((p8==1)&&(p...340
=> equivalent forward existential formula: ([((Init * !(EG(!(!((!(EX(!(!(EX(!((p78==1))))))) + E(TRUE U EX(((p2==1)&&(p92==1)))))))))) * !(E(!(!((!(EX(!(!(...891
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:41:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:41:42] [INFO ] Applying decomposition
[2024-06-02 20:41:42] [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/graph2263829787653952517.txt' '-o' '/tmp/graph2263829787653952517.bin' '-w' '/tmp/graph2263829787653952517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2263829787653952517.bin' '-l' '-1' '-v' '-w' '/tmp/graph2263829787653952517.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:41:42] [INFO ] Decomposing Gal with order
[2024-06-02 20:41:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:41:42] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:41:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 5 ms.
[2024-06-02 20:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14425309893145424222.gal : 3 ms
[2024-06-02 20:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6452332030410614784.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/CTLFireability14425309893145424222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6452332030410614784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56308e+06,2.40226,77156,1349,180,103268,1659,594,425821,87,15901,0


Converting to forward existential form...Done !
original formula: (A(AX(!((((!((i4.u3.p8==1)&&(i0.u32.p96==1)))&&(i3.u2.p7==1))&&(i6.u26.p77==1)))) U !((AX(AX((i6.u35.p78==1))) + EF(EX(((i0.u0.p2==1)&&(i...493
=> equivalent forward existential formula: ([((Init * !(EG(!(!((!(EX(!(!(EX(!((i6.u35.p78==1))))))) + E(TRUE U EX(((i0.u0.p2==1)&&(i0.u30.p92==1)))))))))) ...1152
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t56, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99,...722
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 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
Fast SCC detection found an SCC at level 1
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,20.9705,466900,1,0,652440,5348,3229,1.9117e+06,405,30294,1569572
FORMULA FireWire-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 0 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:42:03] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:42:03] [INFO ] Invariant cache hit.
[2024-06-02 20:42:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:42:03] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:42:03] [INFO ] Invariant cache hit.
[2024-06-02 20:42:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:42:03] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:42:03] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:42:03] [INFO ] Invariant cache hit.
[2024-06-02 20:42:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:42:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:42:05] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:42:06] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12960 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:42:17] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29004 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42161ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42164ms
Finished structural reductions in LTL mode , in 1 iterations and 42395 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:42:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:42:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:42:45] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:42:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:42:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15829486402484030312.gal : 2 ms
[2024-06-02 20:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1425662901374734177.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/CTLFireability15829486402484030312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1425662901374734177.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.56308e+06,2.57343,79208,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: AF(AG(((AX((((p3==0)||(p93==0))&&((p7==0)||(p30==0)))) + (p6==0)) + (p77==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((((p3==0)||(p93==0))&&((p7==0)||(p30==0)))))) + (p6==0)) + (p77==0)))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:43:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:43:15] [INFO ] Applying decomposition
[2024-06-02 20:43:15] [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/graph4058803311701308782.txt' '-o' '/tmp/graph4058803311701308782.bin' '-w' '/tmp/graph4058803311701308782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4058803311701308782.bin' '-l' '-1' '-v' '-w' '/tmp/graph4058803311701308782.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:43:15] [INFO ] Decomposing Gal with order
[2024-06-02 20:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:43:15] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:43:15] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 3 ms.
[2024-06-02 20:43:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1004979468574548923.gal : 2 ms
[2024-06-02 20:43:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13824473797061889135.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/CTLFireability1004979468574548923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13824473797061889135.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56308e+06,11.2285,232960,1695,214,248593,2575,618,1.42986e+06,87,32793,0


Converting to forward existential form...Done !
original formula: AF(AG(((AX((((i1.i1.u1.p3==0)||(i0.u31.p93==0))&&((i4.u2.p7==0)||(i2.u10.p30==0)))) + (i4.u2.p6==0)) + (i6.u26.p77==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((((i1.i1.u1.p3==0)||(i0.u31.p93==0))&&((i4.u2.p7==0)||(i2.u10.p30==0)))))) + ...202
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t56, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99,...722
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:43:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:43:45] [INFO ] Invariant cache hit.
[2024-06-02 20:43:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:43:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:43:45] [INFO ] Invariant cache hit.
[2024-06-02 20:43:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:43:46] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:43:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:43:46] [INFO ] Invariant cache hit.
[2024-06-02 20:43:46] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:43:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:43:47] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:43:47] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:43:47] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:43:48] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:43:48] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-06-02 20:43:48] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12967 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:44:00] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:44:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:44:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42521ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42526ms
Finished structural reductions in LTL mode , in 1 iterations and 42753 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:44:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:28] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:44:28] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:44:28] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:44:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:28] [INFO ] Time to serialize gal into /tmp/CTLFireability399418331212987980.gal : 2 ms
[2024-06-02 20:44:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16165538150517972833.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/CTLFireability399418331212987980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16165538150517972833.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,5.56308e+06,2.6226,79464,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: EG(((AX(((AX(((p10==0)||(p45==0))) * ((p8==0)||(p21==0))) * ((p24==1)&&(p37==1)))) + EG((((p7==1)&&(p30==1))||((p3==1)&&(p103==1))))) + (...232
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(((!(EX(!(((p10==0)||(p45==0))))) * ((p8==0)||(p21==0))) * ((p24==1)&&(p37==1)))))) + EG((((p...305
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:44:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:44:58] [INFO ] Applying decomposition
[2024-06-02 20:44:58] [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/graph12110654657083848644.txt' '-o' '/tmp/graph12110654657083848644.bin' '-w' '/tmp/graph12110654657083848644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12110654657083848644.bin' '-l' '-1' '-v' '-w' '/tmp/graph12110654657083848644.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:44:58] [INFO ] Decomposing Gal with order
[2024-06-02 20:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:44:58] [INFO ] Removed a total of 449 redundant transitions.
[2024-06-02 20:44:58] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 4 ms.
[2024-06-02 20:44:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12595192100639471383.gal : 2 ms
[2024-06-02 20:44:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2843343303292763571.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/CTLFireability12595192100639471383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2843343303292763571.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56308e+06,1.53306,55028,1552,211,66561,2002,608,318616,103,14507,0


Converting to forward existential form...Done !
original formula: EG(((AX(((AX(((i3.u3.p10==0)||(i4.i2.u13.p45==0))) * ((i3.u3.p8==0)||(i4.i0.u7.p21==0))) * ((i1.u9.p24==1)&&(i4.i0.u8.p37==1)))) + EG((((...345
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(((!(EX(!(((i3.u3.p10==0)||(i4.i2.u13.p45==0))))) * ((i3.u3.p8==0)||(i4.i0.u7.p21==0))) * ((i...418
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t56, t59, t60, t65, t70, t75, t80, t94, t96, t136, t145, t1...710
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
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:45:28] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:45:28] [INFO ] Invariant cache hit.
[2024-06-02 20:45:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:45:28] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:45:28] [INFO ] Invariant cache hit.
[2024-06-02 20:45:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:45:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:45:29] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:45:29] [INFO ] Invariant cache hit.
[2024-06-02 20:45:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:45:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:45:31] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:45:43] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42398ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42403ms
Finished structural reductions in LTL mode , in 1 iterations and 42611 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:46:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:46:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:11] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:46:11] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:46:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability714551524568299293.gal : 1 ms
[2024-06-02 20:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3885726088035018769.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/CTLFireability714551524568299293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3885726088035018769.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.56308e+06,2.55855,79256,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: EF((E(AG(((p11==1)&&(p23==1))) U E(EG(((p4==1)&&(p59==1))) U (E((p53==1) U ((p10==1)&&(p84==1))) * AG(((p5==1)&&(p52==1)))))) + (AX(((p7=...201
=> equivalent forward existential formula: ([((FwdU(FwdU(FwdU(Init,TRUE),!(E(TRUE U !(((p11==1)&&(p23==1)))))),EG(((p4==1)&&(p59==1)))) * E((p53==1) U ((p1...316
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
(forward)formula 0,1,5.3099,105036,1,0,539,437582,630,281,6435,408563,622
FORMULA FireWire-PT-06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 110 transition count 299
Applied a total of 8 rules in 19 ms. Remains 110 /113 variables (removed 3) and now considering 299/304 (removed 5) transitions.
[2024-06-02 20:46:16] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
// Phase 1: matrix 274 rows 110 cols
[2024-06-02 20:46:16] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants in 66 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/113 places, 299/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 298
Applied a total of 2 rules in 4 ms. Remains 108 /109 variables (removed 1) and now considering 298/299 (removed 1) transitions.
[2024-06-02 20:46:17] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
// Phase 1: matrix 273 rows 108 cols
[2024-06-02 20:46:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:46:17] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
[2024-06-02 20:46:17] [INFO ] Invariant cache hit.
[2024-06-02 20:46:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 108/113 places, 298/304 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 332 ms. Remains : 108/113 places, 298/304 transitions.
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13450476729847315583.gal : 1 ms
[2024-06-02 20:46:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14514677098194107567.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13450476729847315583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14514677098194107567.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14514677098194107567.prop.
RANDOM walk for 38256 steps (2233 resets) in 196 ms. (194 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 110 transition count 299
Applied a total of 8 rules in 12 ms. Remains 110 /113 variables (removed 3) and now considering 299/304 (removed 5) transitions.
[2024-06-02 20:46:17] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
// Phase 1: matrix 274 rows 110 cols
[2024-06-02 20:46:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants in 55 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/113 places, 299/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 298
Applied a total of 2 rules in 4 ms. Remains 108 /109 variables (removed 1) and now considering 298/299 (removed 1) transitions.
[2024-06-02 20:46:17] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
// Phase 1: matrix 273 rows 108 cols
[2024-06-02 20:46:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:46:17] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
[2024-06-02 20:46:17] [INFO ] Invariant cache hit.
[2024-06-02 20:46:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:46:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 108/113 places, 298/304 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 259 ms. Remains : 108/113 places, 298/304 transitions.
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10879892064795020526.gal : 2 ms
[2024-06-02 20:46:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10834501828329076121.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/CTLFireability10879892064795020526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10834501828329076121.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,3.1337e+06,1.21099,41736,2,3332,5,93201,6,0,729,120476,0


Converting to forward existential form...Done !
original formula: AG(((((p28==0)||(p3==0))||((p43==0)||((p74==1)&&(p108==1)))) * ((A((((p7==1)&&(p27==1))||((p6==1)&&(p77==1))) U A(((p2==1)&&(p46==1)) U (...202
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((((p28==0)||(p3==0))||((p43==0)||((p74==1)&&(p108==1))))))] = FALSE * (([(FwdU((FwdU(((Fw...905
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
(forward)formula 0,0,27.727,737396,1,0,847,3.82508e+06,628,514,6089,3.97035e+06,944
FORMULA FireWire-PT-06-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:46:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:46:45] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:46:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 20:46:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:46:45] [INFO ] Invariant cache hit.
[2024-06-02 20:46:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:46:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:46:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:46:45] [INFO ] Invariant cache hit.
[2024-06-02 20:46:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:46:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:46:47] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:46:47] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:46:47] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:46:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:46:48] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:46:48] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12893 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:46:59] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:47:03] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:47:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 42195ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 42197ms
Finished structural reductions in LTL mode , in 1 iterations and 42507 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:47:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:47:28] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:28] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:47:28] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:28] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5212446559417653497.gal : 2 ms
[2024-06-02 20:47:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8343149194283142750.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/CTLFireability5212446559417653497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8343149194283142750.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,5.56308e+06,2.48813,79404,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: EX(EF((p81==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p81==1))] != FALSE
(forward)formula 0,1,4.16981,79668,1,0,9,213966,9,1,1519,204163,4
FORMULA FireWire-PT-06-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 14 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
[2024-06-02 20:47:32] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
// Phase 1: matrix 272 rows 107 cols
[2024-06-02 20:47:32] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:47:32] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-02 20:47:32] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:47:32] [INFO ] Invariant cache hit.
[2024-06-02 20:47:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:47:32] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-06-02 20:47:32] [INFO ] Redundant transitions in 1 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 20:47:32] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2024-06-02 20:47:32] [INFO ] Invariant cache hit.
[2024-06-02 20:47:32] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:47:34] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 271/378 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:47:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 158 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10368 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:47:44] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 271/378 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:47:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:47:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 455 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15233 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 11/11 constraints]
After SMT, in 25767ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25770ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/113 places, 297/304 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26304 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 20:47:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:47:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:58] [INFO ] Input system was already deterministic with 297 transitions.
[2024-06-02 20:47:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:58] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:47:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15507694479580031144.gal : 2 ms
[2024-06-02 20:47:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1084625625162471374.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/CTLFireability15507694479580031144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1084625625162471374.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,3.1337e+06,1.04171,35188,2,2756,5,83467,6,0,725,96587,0


Converting to forward existential form...Done !
original formula: EG(EF(((p8==1)&&(p63==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p8==1)&&(p63==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
Detected timeout of ITS tools.
[2024-06-02 20:48:28] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:48:28] [INFO ] Applying decomposition
[2024-06-02 20:48:28] [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/graph1065065533452571147.txt' '-o' '/tmp/graph1065065533452571147.bin' '-w' '/tmp/graph1065065533452571147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1065065533452571147.bin' '-l' '-1' '-v' '-w' '/tmp/graph1065065533452571147.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:48:28] [INFO ] Decomposing Gal with order
[2024-06-02 20:48:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:48:28] [INFO ] Removed a total of 448 redundant transitions.
[2024-06-02 20:48:28] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:48:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3 ms.
[2024-06-02 20:48:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5467530281847223616.gal : 2 ms
[2024-06-02 20:48:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9849726651743158120.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/CTLFireability5467530281847223616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9849726651743158120.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,3.1337e+06,4.04542,104048,1231,151,134545,1822,562,511677,83,18277,0


Converting to forward existential form...Done !
original formula: EG(EF(((i4.u3.p8==1)&&(i4.u21.p63==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i4.u3.p8==1)&&(i4.u21.p63==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t40, t43, t46, t47, t56, t61, t66, t71, t76, t90, t92, t128, t137, t142, t144, t145, t146...669
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
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,14.1684,308912,1,0,481434,4894,2999,1.24619e+06,385,30033,1141166
FORMULA FireWire-PT-06-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-06-02 20:48:43] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 20:48:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:48:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:48:43] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:48:43] [INFO ] Invariant cache hit.
[2024-06-02 20:48:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:48:43] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 20:48:43] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 20:48:43] [INFO ] Invariant cache hit.
[2024-06-02 20:48:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:48:44] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:48:44] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:48:45] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:48:45] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:48:45] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:48:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:48:45] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/390 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 40/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 168 constraints, problems are : Problem set: 0 solved, 303 unsolved in 12900 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:48:57] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 277/390 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:49:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 474 constraints, problems are : Problem set: 0 solved, 303 unsolved in 28315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 10/10 constraints]
After SMT, in 41366ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 41370ms
Finished structural reductions in LTL mode , in 1 iterations and 41601 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 20:49:24] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:49:24] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:24] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 20:49:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:49:24] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3564139465333801834.gal : 1 ms
[2024-06-02 20:49:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7421870232645908042.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/CTLFireability3564139465333801834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7421870232645908042.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,5.56308e+06,2.36503,79476,2,4180,5,213943,6,0,753,204163,0


Converting to forward existential form...Done !
original formula: AG((((EX(((p7==1)&&(p30==1))) + (p10==0)) + ((p39==0) + (EG(AF(((p7==0)||(p30==0)))) * AF((AG(((p3==0)||(p22==0))) + EG(((p10==0)||(p103=...235
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !((((p6==1)&&(p90==1))||(((p6==1)&&(p52==1))&&((p7==1)&&(p60==1)))))) * !((EX(((p7==1)&&...480
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2024-06-02 20:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:49:54] [INFO ] Applying decomposition
[2024-06-02 20:49:54] [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/graph7395029574109854674.txt' '-o' '/tmp/graph7395029574109854674.bin' '-w' '/tmp/graph7395029574109854674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7395029574109854674.bin' '-l' '-1' '-v' '-w' '/tmp/graph7395029574109854674.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:49:54] [INFO ] Decomposing Gal with order
[2024-06-02 20:49:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:49:54] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:49:54] [INFO ] Flatten gal took : 40 ms
[2024-06-02 20:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 2 ms.
[2024-06-02 20:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability718871390686757943.gal : 2 ms
[2024-06-02 20:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16385921235871171217.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/CTLFireability718871390686757943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16385921235871171217.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.56308e+06,9.07695,210240,2301,168,280049,1843,610,1.08399e+06,87,17650,0


Converting to forward existential form...Done !
original formula: AG((((EX(((i3.u2.p7==1)&&(i2.u10.p30==1))) + (i1.i0.u3.p10==0)) + ((i1.i0.u12.p39==0) + (EG(AF(((i3.u2.p7==0)||(i2.u10.p30==0)))) * AF((A...355
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !((((i3.u2.p6==1)&&(i6.u30.p90==1))||(((i3.u2.p6==1)&&(i3.u17.p52==1))&&((i3.u2.p7==1)&&...671
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t50, t51, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99, t136, t145, t1...743
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
[2024-06-02 20:50:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:50:25] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:25] [INFO ] Applying decomposition
[2024-06-02 20:50:25] [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/graph9419353642198274181.txt' '-o' '/tmp/graph9419353642198274181.bin' '-w' '/tmp/graph9419353642198274181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9419353642198274181.bin' '-l' '-1' '-v' '-w' '/tmp/graph9419353642198274181.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:50:25] [INFO ] Decomposing Gal with order
[2024-06-02 20:50:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:50:25] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 20:50:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:50:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 2 ms.
[2024-06-02 20:50:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8318129579935710743.gal : 2 ms
[2024-06-02 20:50:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17625983299999176644.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/CTLFireability8318129579935710743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17625983299999176644.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 6 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.56308e+06,3.58637,105944,1403,185,142115,1716,588,606456,87,16807,0


Converting to forward existential form...Done !
original formula: (EG((AG(((i2.u2.p7==0)||(i7.u35.p105==0))) * AX(!(A(((i2.u2.p6==1)&&(i6.u29.p90==1)) U ((i4.u3.p11==1)&&(i7.u28.p86==1))))))) + (EX(AX((A...453
=> equivalent forward existential formula: ([((Init * !(EG((!(E(TRUE U !(((i2.u2.p7==0)||(i7.u35.p105==0))))) * !(EX(!(!(!((E(!(((i4.u3.p11==1)&&(i7.u28.p8...1280
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t56, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99,...722
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
Fast SCC detection found an SCC at level 7
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
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,33.4557,666132,1,0,837766,6429,3292,2.87195e+06,393,38119,1874253
FORMULA FireWire-PT-06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(A(((i7.u25.p74==1)&&(i1.u9.p24==1)) U (((AF(((i2.u2.p7==1)&&(i7.u26.p76==1))) + EF(((i2.u2.p7==1)&&(i7.u35.p105==1)))) + (!(((!(((i3.i2...622
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((((!(EG(!(((i2.u2.p7==1)&&(i7.u26.p76==1))))) + E(TRUE U ((i2.u2.p7==1)&&(i7.u35.p105==1)))) ...1819
(forward)formula 1,1,71.4196,1257068,1,0,1.57345e+06,7355,3472,5.74991e+06,398,51697,3269556
FORMULA FireWire-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((i4.u3.p10==1)&&(i7.u35.p78==1))) * A(!(AF(!(AF(((i0.u0.p2==1)&&(i0.u31.p94==1)))))) U !(((i0.u0.p2==1)&&(i4.u3.p102==1)))))
=> equivalent forward existential formula: [(((Init * E(TRUE U ((i4.u3.p10==1)&&(i7.u35.p78==1)))) * !(EG(!(!(((i0.u0.p2==1)&&(i4.u3.p102==1))))))) * !(E(!...312
(forward)formula 2,1,78.0143,1348264,1,0,1.68301e+06,7605,3552,6.02534e+06,398,53549,3507706
FORMULA FireWire-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG(((AX((((i3.i2.u1.p3==0)||(i0.u31.p93==0))&&((i2.u2.p7==0)||(i1.u11.p30==0)))) + (i2.u2.p6==0)) + (i7.u26.p77==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((((i3.i2.u1.p3==0)||(i0.u31.p93==0))&&((i2.u2.p7==0)||(i1.u11.p30==0)))))) + ...202
(forward)formula 3,0,97.4317,1585512,1,0,2.01447e+06,7684,3569,6.86057e+06,398,54827,4143686
FORMULA FireWire-PT-06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((AX(((AX(((i4.u3.p10==0)||(i3.i2.u14.p45==0))) * ((i4.u3.p8==0)||(i3.i1.u7.p21==0))) * ((i1.u9.p24==1)&&(i3.i1.u8.p37==1)))) + EG((((...345
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(((!(EX(!(((i4.u3.p10==0)||(i3.i2.u14.p45==0))))) * ((i4.u3.p8==0)||(i3.i1.u7.p21==0))) * ((i...418
(forward)formula 4,1,112.921,1790640,1,0,2.26333e+06,8015,3608,7.61963e+06,399,58977,4690729
FORMULA FireWire-PT-06-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((EX(((i2.u2.p7==1)&&(i1.u11.p30==1))) + (i4.u3.p10==0)) + ((i4.u12.p39==0) + (EG(AF(((i2.u2.p7==0)||(i1.u11.p30==0)))) * AF((AG(((i3...343
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !((((i2.u2.p6==1)&&(i6.u29.p90==1))||(((i2.u2.p6==1)&&(i2.u17.p52==1))&&((i2.u2.p7==1)&&...653
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
Fast SCC detection found an SCC at level 7
(forward)formula 5,1,128.375,2043552,1,0,2.5555e+06,8676,3675,8.55368e+06,403,64245,5323997
FORMULA FireWire-PT-06-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1717361553867

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-06"
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-06, 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-171734898800210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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