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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 168K 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-18-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717369559117

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 23:06:00] [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 23:06:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:06:00] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 23:06:00] [INFO ] Transformed 437 places.
[2024-06-02 23:06:00] [INFO ] Transformed 707 transitions.
[2024-06-02 23:06:00] [INFO ] Found NUPN structural information;
[2024-06-02 23:06:00] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 105 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 98 place count 339 transition count 619
Iterating global reduction 1 with 88 rules applied. Total rules applied 186 place count 339 transition count 619
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 201 place count 324 transition count 599
Iterating global reduction 1 with 15 rules applied. Total rules applied 216 place count 324 transition count 599
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 219 place count 321 transition count 594
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 321 transition count 594
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 224 place count 319 transition count 588
Iterating global reduction 1 with 2 rules applied. Total rules applied 226 place count 319 transition count 588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 227 place count 318 transition count 586
Iterating global reduction 1 with 1 rules applied. Total rules applied 228 place count 318 transition count 586
Applied a total of 228 rules in 99 ms. Remains 318 /437 variables (removed 119) and now considering 586/707 (removed 121) transitions.
// Phase 1: matrix 586 rows 318 cols
[2024-06-02 23:06:00] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 23:06:00] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-02 23:06:00] [INFO ] Invariant cache hit.
[2024-06-02 23:06:01] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 585 sub problems to find dead transitions.
[2024-06-02 23:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:07] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 24 ms to minimize.
[2024-06-02 23:06:07] [INFO ] Deduced a trap composed of 182 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 188 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 182 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:06:09] [INFO ] Deduced a trap composed of 107 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:06:09] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 4 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:06:12] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:14] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:06:14] [INFO ] Deduced a trap composed of 98 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:06:14] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:06:15] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:06:15] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:22] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:06:23] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 586/904 variables, 318/345 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/904 variables, and 345 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:35] [INFO ] Deduced a trap composed of 109 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:06:35] [INFO ] Deduced a trap composed of 110 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:40] [INFO ] Deduced a trap composed of 110 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:06:41] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:06:41] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:46] [INFO ] Deduced a trap composed of 151 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 7 (OVERLAPS) 586/904 variables, 318/351 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/904 variables, 585/936 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-06-02 23:06:59] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:07:00] [INFO ] Deduced a trap composed of 180 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/904 variables, and 938 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 28/28 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 318/437 places, 586/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61201 ms. Remains : 318/437 places, 586/707 transitions.
Support contains 105 out of 318 places after structural reductions.
[2024-06-02 23:07:01] [INFO ] Flatten gal took : 73 ms
[2024-06-02 23:07:02] [INFO ] Flatten gal took : 39 ms
[2024-06-02 23:07:02] [INFO ] Input system was already deterministic with 586 transitions.
RANDOM walk for 40000 steps (16 resets) in 1887 ms. (21 steps per ms) remains 65/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 60 ms. (65 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (9 resets) in 12 ms. (307 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4001 steps (10 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (9 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
[2024-06-02 23:07:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 201/293 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 59 unsolved
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 110 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 110 places in 54 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 563/856 variables, 293/305 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 21/877 variables, 11/316 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 18/895 variables, 7/323 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 9/904 variables, 7/330 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/904 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 (/ 3.0 4.0))
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 1.0 4.0))
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 (/ 3.0 4.0))
(s213 (/ 1.0 4.0))
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 (/ 1.0 4.0))
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/904 variables, and 330 constraints, problems are : Problem set: 2 solved, 59 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 205/293 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 58 unsolved
[2024-06-02 23:07:08] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 3 ms to minimize.
[2024-06-02 23:07:08] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 58 unsolved
[2024-06-02 23:07:09] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 58 unsolved
[2024-06-02 23:07:10] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:07:10] [INFO ] Deduced a trap composed of 111 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:07:10] [INFO ] Deduced a trap composed of 104 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 3/18 constraints. Problems are: Problem set: 3 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 563/856 variables, 293/311 constraints. Problems are: Problem set: 3 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/856 variables, 56/367 constraints. Problems are: Problem set: 3 solved, 58 unsolved
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 856/904 variables, and 368 constraints, problems are : Problem set: 3 solved, 58 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 293/318 constraints, PredecessorRefiner: 56/61 constraints, Known Traps: 12/12 constraints]
After SMT, in 10073ms problems are : Problem set: 3 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 128 edges and 318 vertex of which 6 / 318 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 314 transition count 559
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 294 transition count 556
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 293 transition count 552
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 53 place count 289 transition count 552
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 53 place count 289 transition count 536
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 85 place count 273 transition count 536
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 271 transition count 534
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 271 transition count 534
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 137 place count 247 transition count 509
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 163 place count 234 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 169 place count 234 transition count 579
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 178 place count 234 transition count 570
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 187 place count 225 transition count 570
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 224 transition count 569
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 224 transition count 569
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 199 place count 224 transition count 569
Applied a total of 199 rules in 122 ms. Remains 224 /318 variables (removed 94) and now considering 569/586 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 224/318 places, 569/586 transitions.
RANDOM walk for 40000 steps (28 resets) in 422 ms. (94 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4001 steps (20 resets) in 28 ms. (137 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4001 steps (25 resets) in 24 ms. (160 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4000 steps (17 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (18 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (17 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (14 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (19 resets) in 33 ms. (117 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4001 steps (21 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (16 resets) in 36 ms. (108 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (18 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (21 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (14 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (18 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (19 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (21 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (24 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (22 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (17 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (10 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (22 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (18 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (17 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (18 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (12 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (22 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (24 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (20 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (12 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (14 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (27 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (17 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (11 resets) in 18 ms. (210 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4001 steps (18 resets) in 18 ms. (210 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (21 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (18 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (25 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
[2024-06-02 23:07:14] [INFO ] Flow matrix only has 563 transitions (discarded 6 similar events)
// Phase 1: matrix 563 rows 224 cols
[2024-06-02 23:07:14] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:07:14] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 141/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 563/779 variables, 216/226 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 9/235 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 8/787 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/787 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 787/787 variables, and 243 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 224/224 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 141/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 563/779 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 46/284 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 23:07:19] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:07:20] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 8/787 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/787 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/787 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/787 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/787 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 787/787 variables, and 298 constraints, problems are : Problem set: 0 solved, 49 unsolved in 13582 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 224/224 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 9/9 constraints]
After SMT, in 16321ms problems are : Problem set: 0 solved, 49 unsolved
Fused 49 Parikh solutions to 48 different solutions.
Parikh walk visited 1 properties in 30029 ms.
Support contains 74 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 569/569 transitions.
Graph (trivial) has 28 edges and 224 vertex of which 2 / 224 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 223 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 221 transition count 565
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 221 transition count 562
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 218 transition count 562
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 216 transition count 558
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 216 transition count 558
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 215 transition count 557
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 215 transition count 557
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 214 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 213 transition count 560
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 213 transition count 555
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 31 place count 208 transition count 555
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 208 transition count 555
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 207 transition count 554
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 207 transition count 554
Applied a total of 35 rules in 52 ms. Remains 207 /224 variables (removed 17) and now considering 554/569 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 207/224 places, 554/569 transitions.
RANDOM walk for 40000 steps (1503 resets) in 321 ms. (124 steps per ms) remains 41/48 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (37 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (28 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (40 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (39 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (40 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (35 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (35 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (38 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
[2024-06-02 23:08:00] [INFO ] Flow matrix only has 542 transitions (discarded 12 similar events)
// Phase 1: matrix 542 rows 207 cols
[2024-06-02 23:08:00] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:08:00] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 138/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 542/741 variables, 199/208 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 8/749 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/749 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 226 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 138/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:08:03] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:08:03] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 542/741 variables, 199/211 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 35/256 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 23:08:04] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:08:04] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:08:04] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 8/749 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/749 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/749 variables, and 270 constraints, problems are : Problem set: 0 solved, 38 unsolved in 7818 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints]
After SMT, in 9687ms problems are : Problem set: 0 solved, 38 unsolved
Parikh walk visited 0 properties in 30269 ms.
Support contains 61 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 554/554 transitions.
Graph (trivial) has 26 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 206 transition count 550
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 204 transition count 550
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 204 transition count 548
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 202 transition count 548
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 201 transition count 513
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 201 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 201 transition count 512
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 201 transition count 506
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 28 place count 195 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 48 place count 195 transition count 482
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 50 place count 195 transition count 482
Applied a total of 50 rules in 46 ms. Remains 195 /207 variables (removed 12) and now considering 482/554 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 195/207 places, 482/554 transitions.
RANDOM walk for 40000 steps (1469 resets) in 667 ms. (59 steps per ms) remains 29/38 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (33 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (38 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (34 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (35 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2024-06-02 23:08:41] [INFO ] Flow matrix only has 470 transitions (discarded 12 similar events)
// Phase 1: matrix 470 rows 195 cols
[2024-06-02 23:08:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:08:41] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 135/181 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 23:08:41] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 6/187 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 23:08:41] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 470/657 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 36/232 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 8/665 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/665 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/665 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 240 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 195/195 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 135/181 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 6/187 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 470/657 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 36/236 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 23:08:44] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 8/665 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/665 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 273 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 195/195 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 7/7 constraints]
After SMT, in 6773ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 0 properties in 18110 ms.
Support contains 46 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 480
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 193 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 192 transition count 479
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 192 transition count 475
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 188 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 184 transition count 471
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 181 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 181 transition count 478
Applied a total of 32 rules in 25 ms. Remains 181 /195 variables (removed 14) and now considering 478/482 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 181/195 places, 478/482 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-02 23:09:06] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:09:06] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:09:06] [INFO ] Input system was already deterministic with 586 transitions.
Computed a total of 84 stabilizing places and 132 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 210 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 309 transition count 539
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 272 transition count 536
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 271 transition count 534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 269 transition count 534
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 83 place count 269 transition count 510
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 131 place count 245 transition count 510
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 148 place count 228 transition count 447
Iterating global reduction 4 with 17 rules applied. Total rules applied 165 place count 228 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 228 transition count 446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 166 place count 228 transition count 445
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 227 transition count 445
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 175 place count 220 transition count 433
Iterating global reduction 5 with 7 rules applied. Total rules applied 182 place count 220 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 184 place count 220 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 219 transition count 431
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 189 place count 215 transition count 423
Iterating global reduction 7 with 4 rules applied. Total rules applied 193 place count 215 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 195 place count 215 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 196 place count 214 transition count 421
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 198 place count 212 transition count 416
Iterating global reduction 9 with 2 rules applied. Total rules applied 200 place count 212 transition count 416
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 202 place count 210 transition count 411
Iterating global reduction 9 with 2 rules applied. Total rules applied 204 place count 210 transition count 411
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 206 place count 208 transition count 406
Iterating global reduction 9 with 2 rules applied. Total rules applied 208 place count 208 transition count 406
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 210 place count 206 transition count 401
Iterating global reduction 9 with 2 rules applied. Total rules applied 212 place count 206 transition count 401
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 214 place count 204 transition count 396
Iterating global reduction 9 with 2 rules applied. Total rules applied 216 place count 204 transition count 396
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 218 place count 202 transition count 392
Iterating global reduction 9 with 2 rules applied. Total rules applied 220 place count 202 transition count 392
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 222 place count 200 transition count 388
Iterating global reduction 9 with 2 rules applied. Total rules applied 224 place count 200 transition count 388
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 225 place count 199 transition count 386
Iterating global reduction 9 with 1 rules applied. Total rules applied 226 place count 199 transition count 386
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 256 place count 184 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 258 place count 184 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 259 place count 183 transition count 369
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 260 place count 182 transition count 349
Iterating global reduction 11 with 1 rules applied. Total rules applied 261 place count 182 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 262 place count 182 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 263 place count 181 transition count 347
Applied a total of 263 rules in 97 ms. Remains 181 /318 variables (removed 137) and now considering 347/586 (removed 239) transitions.
[2024-06-02 23:09:06] [INFO ] Flow matrix only has 343 transitions (discarded 4 similar events)
// Phase 1: matrix 343 rows 181 cols
[2024-06-02 23:09:06] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:09:06] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:09:06] [INFO ] Flow matrix only has 343 transitions (discarded 4 similar events)
[2024-06-02 23:09:06] [INFO ] Invariant cache hit.
[2024-06-02 23:09:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:09:06] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 23:09:06] [INFO ] Redundant transitions in 18 ms returned []
Running 339 sub problems to find dead transitions.
[2024-06-02 23:09:06] [INFO ] Flow matrix only has 343 transitions (discarded 4 similar events)
[2024-06-02 23:09:06] [INFO ] Invariant cache hit.
[2024-06-02 23:09:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 1/179 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-02 23:09:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:09:11] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 128 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 342/521 variables, 179/195 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-02 23:09:17] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 10 (OVERLAPS) 2/523 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 12 (OVERLAPS) 0/523 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/524 variables, and 200 constraints, problems are : Problem set: 0 solved, 339 unsolved in 23281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 1/179 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 342/521 variables, 179/196 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 339/537 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 10 (OVERLAPS) 2/523 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 12 (OVERLAPS) 0/523 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/524 variables, and 539 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 10/10 constraints]
After SMT, in 53414ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 53417ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/318 places, 347/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53824 ms. Remains : 181/318 places, 347/586 transitions.
[2024-06-02 23:10:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:10:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:10:00] [INFO ] Input system was already deterministic with 347 transitions.
[2024-06-02 23:10:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:10:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:10:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8061693401819669799.gal : 11 ms
[2024-06-02 23:10:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13872209453198452078.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8061693401819669799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13872209453198452078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14623e+09,8.86815,224912,2,9659,5,544652,6,0,1067,971298,0


Converting to forward existential form...Done !
original formula: AF((A(((p435==1)||((p37==1)&&(p174==1))) U ((p357==1)&&(p218==1))) + EF(((p259==1)||((p19==1)&&(p163==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((p357==1)&&(p218==1))) U (!(((p435==1)||((p37==1)&&(p174==1)))) * !(((p357==1)&&(p218==1))...251
Reverse transition relation is NOT exact ! Due to transitions t2, t20, t25, t29, t32, t34, t40, t42, t45, t68, t75, t77, t79, t80, t85, t87, t93, t95, t96,...706
Detected timeout of ITS tools.
[2024-06-02 23:10:30] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:10:30] [INFO ] Applying decomposition
[2024-06-02 23:10:30] [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/graph2437165277156875557.txt' '-o' '/tmp/graph2437165277156875557.bin' '-w' '/tmp/graph2437165277156875557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2437165277156875557.bin' '-l' '-1' '-v' '-w' '/tmp/graph2437165277156875557.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:10:30] [INFO ] Decomposing Gal with order
[2024-06-02 23:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:10:30] [INFO ] Removed a total of 412 redundant transitions.
[2024-06-02 23:10:30] [INFO ] Flatten gal took : 100 ms
[2024-06-02 23:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 33 ms.
[2024-06-02 23:10:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2910969654036361130.gal : 18 ms
[2024-06-02 23:10:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7075456488810017049.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/CTLFireability2910969654036361130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7075456488810017049.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 221 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 309 transition count 534
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 267 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 266 transition count 531
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 89 place count 266 transition count 508
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 135 place count 243 transition count 508
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 148 place count 230 transition count 450
Iterating global reduction 3 with 13 rules applied. Total rules applied 161 place count 230 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 230 transition count 449
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 230 transition count 448
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 229 transition count 448
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 169 place count 224 transition count 439
Iterating global reduction 4 with 5 rules applied. Total rules applied 174 place count 224 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 176 place count 224 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 223 transition count 437
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 181 place count 219 transition count 429
Iterating global reduction 6 with 4 rules applied. Total rules applied 185 place count 219 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 187 place count 219 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 188 place count 218 transition count 427
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 190 place count 216 transition count 422
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 216 transition count 422
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 194 place count 214 transition count 417
Iterating global reduction 8 with 2 rules applied. Total rules applied 196 place count 214 transition count 417
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 198 place count 212 transition count 412
Iterating global reduction 8 with 2 rules applied. Total rules applied 200 place count 212 transition count 412
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 201 place count 211 transition count 410
Iterating global reduction 8 with 1 rules applied. Total rules applied 202 place count 211 transition count 410
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 236 place count 194 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 238 place count 194 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 239 place count 193 transition count 391
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 241 place count 191 transition count 369
Iterating global reduction 10 with 2 rules applied. Total rules applied 243 place count 191 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 244 place count 191 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 245 place count 190 transition count 367
Applied a total of 245 rules in 74 ms. Remains 190 /318 variables (removed 128) and now considering 367/586 (removed 219) transitions.
[2024-06-02 23:11:00] [INFO ] Flow matrix only has 363 transitions (discarded 4 similar events)
// Phase 1: matrix 363 rows 190 cols
[2024-06-02 23:11:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:11:00] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:11:00] [INFO ] Flow matrix only has 363 transitions (discarded 4 similar events)
[2024-06-02 23:11:00] [INFO ] Invariant cache hit.
[2024-06-02 23:11:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:11:01] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-02 23:11:01] [INFO ] Redundant transitions in 6 ms returned []
Running 358 sub problems to find dead transitions.
[2024-06-02 23:11:01] [INFO ] Flow matrix only has 363 transitions (discarded 4 similar events)
[2024-06-02 23:11:01] [INFO ] Invariant cache hit.
[2024-06-02 23:11:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:11:03] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:11:03] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:11:03] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:11:04] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:11:04] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:11:04] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:11:04] [INFO ] Deduced a trap composed of 136 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 362/550 variables, 188/207 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (OVERLAPS) 2/552 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 358 unsolved in 22490 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 362/550 variables, 188/208 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 358/568 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:11:32] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (OVERLAPS) 2/552 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/553 variables, and 571 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 14/14 constraints]
After SMT, in 52624ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 52627ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/318 places, 367/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52996 ms. Remains : 190/318 places, 367/586 transitions.
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 27 ms
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:11:53] [INFO ] Input system was already deterministic with 367 transitions.
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:11:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18223757624665121866.gal : 3 ms
[2024-06-02 23:11:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5497693575175444032.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/CTLFireability18223757624665121866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5497693575175444032.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1528e+09,13.4808,332412,2,12163,5,746577,6,0,1123,1.32262e+06,0


Converting to forward existential form...Done !
original formula: EF(((((p12==1)&&(p237==1)) + ((EF(((p51==1)&&(p153==1))) * (p14==1)) * (p332==1))) + (EG(((p37==0)||(p365==0))) * ((p216==1)||((p52==1)&&...169
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((p12==1)&&(p237==1)))] != FALSE + [(FwdU(((FwdU(Init,TRUE) * (p332==1)) * (p14==1)),TRUE)...288
(forward)formula 0,1,13.4872,332412,1,0,7,746577,8,1,1129,1.32262e+06,1
FORMULA FireWire-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 227 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 309 transition count 534
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 267 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 266 transition count 531
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 89 place count 266 transition count 507
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 137 place count 242 transition count 507
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 152 place count 227 transition count 446
Iterating global reduction 3 with 15 rules applied. Total rules applied 167 place count 227 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 227 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 168 place count 227 transition count 443
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 225 transition count 443
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 178 place count 219 transition count 433
Iterating global reduction 4 with 6 rules applied. Total rules applied 184 place count 219 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 186 place count 219 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 187 place count 218 transition count 431
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 192 place count 213 transition count 421
Iterating global reduction 6 with 5 rules applied. Total rules applied 197 place count 213 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 199 place count 213 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 200 place count 212 transition count 419
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 202 place count 210 transition count 414
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 210 transition count 414
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 206 place count 208 transition count 409
Iterating global reduction 8 with 2 rules applied. Total rules applied 208 place count 208 transition count 409
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 210 place count 206 transition count 404
Iterating global reduction 8 with 2 rules applied. Total rules applied 212 place count 206 transition count 404
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 214 place count 204 transition count 399
Iterating global reduction 8 with 2 rules applied. Total rules applied 216 place count 204 transition count 399
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 218 place count 202 transition count 394
Iterating global reduction 8 with 2 rules applied. Total rules applied 220 place count 202 transition count 394
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 222 place count 200 transition count 390
Iterating global reduction 8 with 2 rules applied. Total rules applied 224 place count 200 transition count 390
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 226 place count 198 transition count 386
Iterating global reduction 8 with 2 rules applied. Total rules applied 228 place count 198 transition count 386
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 229 place count 197 transition count 384
Iterating global reduction 8 with 1 rules applied. Total rules applied 230 place count 197 transition count 384
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 260 place count 182 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 262 place count 182 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 263 place count 181 transition count 367
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 265 place count 179 transition count 345
Iterating global reduction 10 with 2 rules applied. Total rules applied 267 place count 179 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 268 place count 179 transition count 344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 269 place count 178 transition count 343
Applied a total of 269 rules in 158 ms. Remains 178 /318 variables (removed 140) and now considering 343/586 (removed 243) transitions.
[2024-06-02 23:12:07] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
// Phase 1: matrix 339 rows 178 cols
[2024-06-02 23:12:07] [INFO ] Computed 7 invariants in 17 ms
[2024-06-02 23:12:07] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 23:12:07] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
[2024-06-02 23:12:07] [INFO ] Invariant cache hit.
[2024-06-02 23:12:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:12:08] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-06-02 23:12:08] [INFO ] Redundant transitions in 5 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-02 23:12:08] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
[2024-06-02 23:12:08] [INFO ] Invariant cache hit.
[2024-06-02 23:12:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 124 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 338/514 variables, 176/193 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 2/516 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/517 variables, and 197 constraints, problems are : Problem set: 0 solved, 334 unsolved in 14943 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 338/514 variables, 176/193 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 334/529 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 2/516 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (OVERLAPS) 0/516 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/517 variables, and 531 constraints, problems are : Problem set: 0 solved, 334 unsolved in 25271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 10/10 constraints]
After SMT, in 40348ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 40352ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/318 places, 343/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41269 ms. Remains : 178/318 places, 343/586 transitions.
[2024-06-02 23:12:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:12:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:12:48] [INFO ] Input system was already deterministic with 343 transitions.
[2024-06-02 23:12:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:12:48] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability819392525783482329.gal : 15 ms
[2024-06-02 23:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5951801285174805066.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/CTLFireability819392525783482329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5951801285174805066.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07156e+09,10.3233,254924,2,9936,5,608248,6,0,1051,1.07308e+06,0


Converting to forward existential form...Done !
original formula: AF(EG(!(E((p4!=1) U AG(((p51==1)&&(p348==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((p4!=1) U !(E(TRUE U !(((p51==1)&&(p348==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t21, t30, t33, t35, t40, t42, t45, t65, t71, t73, t75, t76, t81, t83, t89, t91, t92, t96,...710
Detected timeout of ITS tools.
[2024-06-02 23:13:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:13:18] [INFO ] Applying decomposition
[2024-06-02 23:13:18] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph682491741016516273.txt' '-o' '/tmp/graph682491741016516273.bin' '-w' '/tmp/graph682491741016516273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph682491741016516273.bin' '-l' '-1' '-v' '-w' '/tmp/graph682491741016516273.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:13:18] [INFO ] Decomposing Gal with order
[2024-06-02 23:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:13:18] [INFO ] Removed a total of 413 redundant transitions.
[2024-06-02 23:13:18] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2024-06-02 23:13:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14496656082091638575.gal : 4 ms
[2024-06-02 23:13:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17648416623208896944.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/CTLFireability14496656082091638575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17648416623208896944.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07156e+09,3.82256,110004,1290,75,169722,1048,780,427020,84,3642,0


Converting to forward existential form...Done !
original formula: AF(EG(!(E((i2.u8.p4!=1) U AG(((i0.i0.u5.p51==1)&&(i8.u55.p348==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((i2.u8.p4!=1) U !(E(TRUE U !(((i0.i0.u5.p51==1)&&(i8.u55.p348==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t33, t89, t91, t92, t96, t97, t103, t104, t106, t129, t132, t135, t137, t172, t173, t175, t20...971
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,9.71369,205836,1,0,305586,1791,4480,753105,388,6715,594933
FORMULA FireWire-PT-18-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 215 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 309 transition count 538
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 271 transition count 535
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 270 transition count 533
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 268 transition count 533
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 85 place count 268 transition count 510
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 131 place count 245 transition count 510
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 144 place count 232 transition count 470
Iterating global reduction 4 with 13 rules applied. Total rules applied 157 place count 232 transition count 470
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 157 place count 232 transition count 468
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 230 transition count 468
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 167 place count 224 transition count 458
Iterating global reduction 4 with 6 rules applied. Total rules applied 173 place count 224 transition count 458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 175 place count 224 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 223 transition count 456
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 180 place count 219 transition count 449
Iterating global reduction 6 with 4 rules applied. Total rules applied 184 place count 219 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 186 place count 219 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 187 place count 218 transition count 447
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 188 place count 217 transition count 444
Iterating global reduction 8 with 1 rules applied. Total rules applied 189 place count 217 transition count 444
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 190 place count 216 transition count 442
Iterating global reduction 8 with 1 rules applied. Total rules applied 191 place count 216 transition count 442
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 192 place count 215 transition count 439
Iterating global reduction 8 with 1 rules applied. Total rules applied 193 place count 215 transition count 439
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 194 place count 214 transition count 437
Iterating global reduction 8 with 1 rules applied. Total rules applied 195 place count 214 transition count 437
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 196 place count 213 transition count 434
Iterating global reduction 8 with 1 rules applied. Total rules applied 197 place count 213 transition count 434
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 198 place count 212 transition count 432
Iterating global reduction 8 with 1 rules applied. Total rules applied 199 place count 212 transition count 432
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 200 place count 211 transition count 430
Iterating global reduction 8 with 1 rules applied. Total rules applied 201 place count 211 transition count 430
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 202 place count 210 transition count 428
Iterating global reduction 8 with 1 rules applied. Total rules applied 203 place count 210 transition count 428
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 235 place count 194 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 237 place count 194 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 238 place count 193 transition count 410
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 240 place count 191 transition count 388
Iterating global reduction 10 with 2 rules applied. Total rules applied 242 place count 191 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 243 place count 191 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 244 place count 190 transition count 386
Applied a total of 244 rules in 83 ms. Remains 190 /318 variables (removed 128) and now considering 386/586 (removed 200) transitions.
[2024-06-02 23:13:28] [INFO ] Flow matrix only has 382 transitions (discarded 4 similar events)
// Phase 1: matrix 382 rows 190 cols
[2024-06-02 23:13:28] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:13:28] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:13:28] [INFO ] Flow matrix only has 382 transitions (discarded 4 similar events)
[2024-06-02 23:13:28] [INFO ] Invariant cache hit.
[2024-06-02 23:13:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:13:29] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 23:13:29] [INFO ] Redundant transitions in 3 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-02 23:13:29] [INFO ] Flow matrix only has 382 transitions (discarded 4 similar events)
[2024-06-02 23:13:29] [INFO ] Invariant cache hit.
[2024-06-02 23:13:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 130 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 381/569 variables, 188/204 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 2/571 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (OVERLAPS) 0/571 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/572 variables, and 208 constraints, problems are : Problem set: 0 solved, 377 unsolved in 17397 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 381/569 variables, 188/204 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 377/583 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 2/571 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-02 23:14:00] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/572 variables, and 586 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 10/10 constraints]
After SMT, in 47546ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 47551ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/318 places, 386/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47938 ms. Remains : 190/318 places, 386/586 transitions.
[2024-06-02 23:14:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:14:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:14:16] [INFO ] Input system was already deterministic with 386 transitions.
[2024-06-02 23:14:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:14:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:14:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4740051184337436764.gal : 3 ms
[2024-06-02 23:14:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2495449053469781448.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/CTLFireability4740051184337436764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2495449053469781448.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40071e+09,14.7658,343352,2,11952,5,782902,6,0,1142,1.31194e+06,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p12==0)||(p328==0))) + EG(AG(((p41==1)&&(p376==1))))) + (((p295==1)&&(p381==1))&&(((p103==1)&&(p202==1))||(((p11==1)&&(p25==1))...171
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(((p12==0)||(p328==0))))))] != FALSE + [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((p4...307
Reverse transition relation is NOT exact ! Due to transitions t2, t23, t32, t35, t38, t42, t44, t47, t67, t73, t75, t77, t78, t84, t86, t93, t95, t96, t100...762
Detected timeout of ITS tools.
[2024-06-02 23:14:46] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:14:46] [INFO ] Applying decomposition
[2024-06-02 23:14:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5137095368958581042.txt' '-o' '/tmp/graph5137095368958581042.bin' '-w' '/tmp/graph5137095368958581042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5137095368958581042.bin' '-l' '-1' '-v' '-w' '/tmp/graph5137095368958581042.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:14:46] [INFO ] Decomposing Gal with order
[2024-06-02 23:14:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:14:46] [INFO ] Removed a total of 482 redundant transitions.
[2024-06-02 23:14:46] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 6 ms.
[2024-06-02 23:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9438075804505746801.gal : 19 ms
[2024-06-02 23:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6019989652965043933.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/CTLFireability9438075804505746801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6019989652965043933.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 226 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 309 transition count 534
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 267 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 266 transition count 531
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 89 place count 266 transition count 508
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 135 place count 243 transition count 508
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 149 place count 229 transition count 467
Iterating global reduction 3 with 14 rules applied. Total rules applied 163 place count 229 transition count 467
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 163 place count 229 transition count 465
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 227 transition count 465
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 173 place count 221 transition count 455
Iterating global reduction 3 with 6 rules applied. Total rules applied 179 place count 221 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 221 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 182 place count 220 transition count 453
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 187 place count 215 transition count 443
Iterating global reduction 5 with 5 rules applied. Total rules applied 192 place count 215 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 215 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 214 transition count 441
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 197 place count 212 transition count 436
Iterating global reduction 7 with 2 rules applied. Total rules applied 199 place count 212 transition count 436
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 201 place count 210 transition count 431
Iterating global reduction 7 with 2 rules applied. Total rules applied 203 place count 210 transition count 431
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 205 place count 208 transition count 426
Iterating global reduction 7 with 2 rules applied. Total rules applied 207 place count 208 transition count 426
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 209 place count 206 transition count 421
Iterating global reduction 7 with 2 rules applied. Total rules applied 211 place count 206 transition count 421
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 213 place count 204 transition count 416
Iterating global reduction 7 with 2 rules applied. Total rules applied 215 place count 204 transition count 416
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 217 place count 202 transition count 412
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 202 transition count 412
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 221 place count 200 transition count 408
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 200 transition count 408
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 224 place count 199 transition count 406
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 199 transition count 406
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 257 place count 183 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 259 place count 183 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 260 place count 182 transition count 388
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 262 place count 180 transition count 366
Iterating global reduction 9 with 2 rules applied. Total rules applied 264 place count 180 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 265 place count 180 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 266 place count 179 transition count 364
Applied a total of 266 rules in 156 ms. Remains 179 /318 variables (removed 139) and now considering 364/586 (removed 222) transitions.
[2024-06-02 23:15:17] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
// Phase 1: matrix 360 rows 179 cols
[2024-06-02 23:15:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:17] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-02 23:15:17] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
[2024-06-02 23:15:17] [INFO ] Invariant cache hit.
[2024-06-02 23:15:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:15:17] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-06-02 23:15:17] [INFO ] Redundant transitions in 2 ms returned []
Running 355 sub problems to find dead transitions.
[2024-06-02 23:15:17] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
[2024-06-02 23:15:17] [INFO ] Invariant cache hit.
[2024-06-02 23:15:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:15:21] [INFO ] Deduced a trap composed of 125 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:15:21] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 359/536 variables, 177/193 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (OVERLAPS) 2/538 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/539 variables, and 197 constraints, problems are : Problem set: 0 solved, 355 unsolved in 15030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 359/536 variables, 177/193 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 355/550 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 2/538 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/538 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/539 variables, and 553 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 10/10 constraints]
After SMT, in 45146ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 45149ms
Starting structural reductions in SI_CTL mode, iteration 1 : 179/318 places, 364/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46024 ms. Remains : 179/318 places, 364/586 transitions.
[2024-06-02 23:16:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:16:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:16:03] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-02 23:16:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:16:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:16:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18288572537646863961.gal : 34 ms
[2024-06-02 23:16:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12567412086632167276.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18288572537646863961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12567412086632167276.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (1738 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (415 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12567412086632167276.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 182
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :182 after 325
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :325 after 585
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :585 after 903
Finished probabilistic random walk after 110759 steps, run visited all 1 properties in 411 ms. (steps per millisecond=269 )
Probabilistic random walk after 110759 steps, saw 27562 distinct states, run finished after 439 ms. (steps per millisecond=252 ) properties seen :1
FORMULA FireWire-PT-18-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 296 transition count 519
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 296 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 296 transition count 518
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 289 transition count 489
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 289 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 285 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 285 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 285 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 284 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 284 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 283 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 283 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 282 transition count 473
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 282 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 281 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 281 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 280 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 280 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 279 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 279 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 278 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 277 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 277 transition count 463
Applied a total of 84 rules in 38 ms. Remains 277 /318 variables (removed 41) and now considering 463/586 (removed 123) transitions.
// Phase 1: matrix 463 rows 277 cols
[2024-06-02 23:16:03] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:16:03] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-02 23:16:04] [INFO ] Invariant cache hit.
[2024-06-02 23:16:04] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 23:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 155 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 463/740 variables, 277/294 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:16:21] [INFO ] Deduced a trap composed of 127 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:16:21] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:16:21] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 297 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 158 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 156 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:16:37] [INFO ] Deduced a trap composed of 160 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:16:37] [INFO ] Deduced a trap composed of 161 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:16:37] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 463/740 variables, 277/304 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 462/766 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 177 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 171 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 768 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 22/22 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 277/318 places, 463/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 277/318 places, 463/586 transitions.
[2024-06-02 23:17:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:17:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:04] [INFO ] Input system was already deterministic with 463 transitions.
[2024-06-02 23:17:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13635438268271536217.gal : 3 ms
[2024-06-02 23:17:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8458362451352577282.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/CTLFireability13635438268271536217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8458362451352577282.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,2.59691e+10,27.206,697804,2,24948,5,1.47041e+06,6,0,1571,3.13548e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:17:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:17:34] [INFO ] Applying decomposition
[2024-06-02 23:17:34] [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/graph13775825290121509702.txt' '-o' '/tmp/graph13775825290121509702.bin' '-w' '/tmp/graph13775825290121509702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13775825290121509702.bin' '-l' '-1' '-v' '-w' '/tmp/graph13775825290121509702.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:17:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:17:34] [INFO ] Removed a total of 501 redundant transitions.
[2024-06-02 23:17:34] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 6 ms.
[2024-06-02 23:17:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17921379087749294055.gal : 11 ms
[2024-06-02 23:17:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15290739462816623068.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/CTLFireability17921379087749294055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15290739462816623068.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,2.59691e+10,25.9692,683664,2253,58,638398,947,1027,5.6439e+06,80,3877,0


Converting to forward existential form...Done !
original formula: EF(AG((EG(((i6.i0.u9.p51==0)||(i0.u77.p341==0))) + ((AX(((i9.u61.p287==0)||(i9.u82.p317==0))) * (i1.i0.u0.p58==1)) * ((i4.i1.u40.p179==1)...223
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG(((i6.i0.u9.p51==0)||(i0.u77.p341==0))) + ((!(EX(!(((i9.u61.p287==0)||(i9.u8...293
Reverse transition relation is NOT exact ! Due to transitions t64, t149, t189, t190, t192, t201, t203, t210, t215, t216, t218, t246, t247, t251, t252, t253...1165
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 294 transition count 516
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 294 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 294 transition count 514
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 286 transition count 501
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 286 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 286 transition count 500
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 281 transition count 490
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 281 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 281 transition count 489
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 279 transition count 484
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 279 transition count 484
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 277 transition count 479
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 277 transition count 479
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 275 transition count 474
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 275 transition count 474
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 273 transition count 469
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 273 transition count 469
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 271 transition count 464
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 271 transition count 464
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 269 transition count 460
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 269 transition count 460
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 267 transition count 456
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 267 transition count 456
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 265 transition count 453
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 265 transition count 453
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 264 transition count 452
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 264 transition count 452
Applied a total of 112 rules in 31 ms. Remains 264 /318 variables (removed 54) and now considering 452/586 (removed 134) transitions.
// Phase 1: matrix 452 rows 264 cols
[2024-06-02 23:18:05] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:18:05] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 23:18:05] [INFO ] Invariant cache hit.
[2024-06-02 23:18:05] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 451 sub problems to find dead transitions.
[2024-06-02 23:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:09] [INFO ] Deduced a trap composed of 179 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:18:09] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:18:11] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:18:11] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:12] [INFO ] Deduced a trap composed of 149 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:18:12] [INFO ] Deduced a trap composed of 147 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:18:12] [INFO ] Deduced a trap composed of 149 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:18:14] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:18] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:18:18] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:18:19] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:18:19] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:20] [INFO ] Deduced a trap composed of 150 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 7 (OVERLAPS) 452/716 variables, 264/287 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:28] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 716/716 variables, and 288 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 452/716 variables, 264/288 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/716 variables, 451/739 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:43] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:18:45] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 451 unsolved
[2024-06-02 23:18:58] [INFO ] Deduced a trap composed of 169 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/716 variables, and 742 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 20/20 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 264/318 places, 452/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 264/318 places, 452/586 transitions.
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Input system was already deterministic with 452 transitions.
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16973215624892788711.gal : 3 ms
[2024-06-02 23:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13182114600434528241.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/CTLFireability16973215624892788711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13182114600434528241.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,2.51837e+10,29.3545,702260,2,21913,5,1.54557e+06,6,0,1508,3.4209e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:19:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:19:35] [INFO ] Applying decomposition
[2024-06-02 23:19:35] [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/graph15829882451960119562.txt' '-o' '/tmp/graph15829882451960119562.bin' '-w' '/tmp/graph15829882451960119562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15829882451960119562.bin' '-l' '-1' '-v' '-w' '/tmp/graph15829882451960119562.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:35] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:35] [INFO ] Removed a total of 507 redundant transitions.
[2024-06-02 23:19:35] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 6 ms.
[2024-06-02 23:19:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1708826705644115677.gal : 3 ms
[2024-06-02 23:19:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8494526742658278398.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/CTLFireability1708826705644115677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8494526742658278398.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,2.51837e+10,16.4618,484048,2930,69,844191,1114,1014,2.42075e+06,87,3685,0


Converting to forward existential form...Done !
original formula: EX(EF(EG(((i1.u9.p43==1)&&(i5.i2.u43.p174==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),((i1.u9.p43==1)&&(i5.i2.u43.p174==1)))] != FALSE
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,27.2642,516784,1,0,900610,1371,4167,2.73559e+06,284,5044,1993695
FORMULA FireWire-PT-18-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 297 transition count 558
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 297 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 297 transition count 557
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 290 transition count 527
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 290 transition count 527
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 287 transition count 522
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 287 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 287 transition count 521
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 286 transition count 518
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 286 transition count 518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 285 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 285 transition count 516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 284 transition count 513
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 284 transition count 513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 283 transition count 511
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 283 transition count 511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 282 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 282 transition count 508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 281 transition count 506
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 281 transition count 506
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 280 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 280 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 279 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 279 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 278 transition count 501
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 278 transition count 501
Applied a total of 82 rules in 30 ms. Remains 278 /318 variables (removed 40) and now considering 501/586 (removed 85) transitions.
// Phase 1: matrix 501 rows 278 cols
[2024-06-02 23:20:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:20:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:20:03] [INFO ] Invariant cache hit.
[2024-06-02 23:20:03] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-02 23:20:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 183 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 91 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 2 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 157 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (OVERLAPS) 501/779 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:20:21] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:20:23] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/779 variables, and 300 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 501/779 variables, 278/300 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 500/800 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:20:43] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:20:43] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:20:44] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 1 ms to minimize.
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 172 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:20:45] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:20:46] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 6/806 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 155 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/779 variables, and 807 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 22/22 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 278/318 places, 501/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 278/318 places, 501/586 transitions.
[2024-06-02 23:21:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:21:03] [INFO ] Input system was already deterministic with 501 transitions.
[2024-06-02 23:21:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:03] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:21:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3902589722106262303.gal : 3 ms
[2024-06-02 23:21:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14369928446452558964.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/CTLFireability3902589722106262303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14369928446452558964.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.
Detected timeout of ITS tools.
[2024-06-02 23:21:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:21:33] [INFO ] Applying decomposition
[2024-06-02 23:21:33] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17651564133659082958.txt' '-o' '/tmp/graph17651564133659082958.bin' '-w' '/tmp/graph17651564133659082958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17651564133659082958.bin' '-l' '-1' '-v' '-w' '/tmp/graph17651564133659082958.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:21:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:21:34] [INFO ] Removed a total of 569 redundant transitions.
[2024-06-02 23:21:34] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 7 ms.
[2024-06-02 23:21:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13326182166431246323.gal : 20 ms
[2024-06-02 23:21:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9917367251034860384.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/CTLFireability13326182166431246323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9917367251034860384.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,2.73813e+10,24.3112,660964,3869,87,894620,2006,1017,4.30056e+06,100,7917,0


Converting to forward existential form...Done !
original formula: AX((((E(((i1.i0.u7.p20==1)&&(i9.i0.u64.p316==1)) U (i0.i0.u83.p371==1)) + AF(AG(((i0.i0.u3.p41==0)||(i5.u43.p188==0))))) * (A((i9.i1.u78....315
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(E(((i1.i0.u7.p20==1)&&(i9.i0.u64.p316==1)) U (i0.i0.u83.p371==1)))),!(!(E(TRUE U !(((i0.i0...532
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Reverse transition relation is NOT exact ! Due to transitions t60, t67, t144, t151, t190, t191, t193, t202, t204, t211, t216, t217, t219, t250, t251, t308,...1328
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 227 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 309 transition count 534
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 267 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 266 transition count 531
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 89 place count 266 transition count 507
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 137 place count 242 transition count 507
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 151 place count 228 transition count 448
Iterating global reduction 3 with 14 rules applied. Total rules applied 165 place count 228 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 228 transition count 447
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 166 place count 228 transition count 445
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 226 transition count 445
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 176 place count 220 transition count 435
Iterating global reduction 4 with 6 rules applied. Total rules applied 182 place count 220 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 184 place count 220 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 219 transition count 433
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 190 place count 214 transition count 423
Iterating global reduction 6 with 5 rules applied. Total rules applied 195 place count 214 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 197 place count 214 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 198 place count 213 transition count 421
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 200 place count 211 transition count 416
Iterating global reduction 8 with 2 rules applied. Total rules applied 202 place count 211 transition count 416
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 204 place count 209 transition count 411
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 209 transition count 411
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 208 place count 207 transition count 406
Iterating global reduction 8 with 2 rules applied. Total rules applied 210 place count 207 transition count 406
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 212 place count 205 transition count 401
Iterating global reduction 8 with 2 rules applied. Total rules applied 214 place count 205 transition count 401
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 216 place count 203 transition count 396
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 203 transition count 396
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 220 place count 201 transition count 392
Iterating global reduction 8 with 2 rules applied. Total rules applied 222 place count 201 transition count 392
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 224 place count 199 transition count 388
Iterating global reduction 8 with 2 rules applied. Total rules applied 226 place count 199 transition count 388
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 227 place count 198 transition count 386
Iterating global reduction 8 with 1 rules applied. Total rules applied 228 place count 198 transition count 386
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 260 place count 182 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 262 place count 182 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 263 place count 181 transition count 368
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 265 place count 179 transition count 346
Iterating global reduction 10 with 2 rules applied. Total rules applied 267 place count 179 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 268 place count 179 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 269 place count 178 transition count 344
Applied a total of 269 rules in 98 ms. Remains 178 /318 variables (removed 140) and now considering 344/586 (removed 242) transitions.
[2024-06-02 23:22:04] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
// Phase 1: matrix 340 rows 178 cols
[2024-06-02 23:22:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:22:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:22:04] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
[2024-06-02 23:22:04] [INFO ] Invariant cache hit.
[2024-06-02 23:22:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:22:04] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 23:22:04] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-02 23:22:04] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
[2024-06-02 23:22:04] [INFO ] Invariant cache hit.
[2024-06-02 23:22:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 23:22:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:22:05] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:22:06] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:22:06] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:22:06] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:22:06] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:22:07] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:22:07] [INFO ] Deduced a trap composed of 125 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:22:07] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-02 23:22:07] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 339/515 variables, 176/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 2/517 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/517 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/518 variables, and 197 constraints, problems are : Problem set: 0 solved, 335 unsolved in 17418 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (OVERLAPS) 339/515 variables, 176/193 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 335/530 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 2/517 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/517 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/518 variables, and 532 constraints, problems are : Problem set: 0 solved, 335 unsolved in 28202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 10/10 constraints]
After SMT, in 45715ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 45718ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/318 places, 344/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46119 ms. Remains : 178/318 places, 344/586 transitions.
[2024-06-02 23:22:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:22:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:22:50] [INFO ] Input system was already deterministic with 344 transitions.
[2024-06-02 23:22:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:22:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11401101797861959555.gal : 2 ms
[2024-06-02 23:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10425418047244080858.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/CTLFireability11401101797861959555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10425418047244080858.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06715e+09,8.47568,226376,2,9566,5,534842,6,0,1052,984316,0


Converting to forward existential form...Done !
original formula: AF(AG(((p51==0)||(p153==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p51==0)||(p153==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t21, t30, t33, t35, t40, t42, t45, t65, t71, t73, t75, t76, t81, t83, t89, t91, t92, t96,...705
Detected timeout of ITS tools.
[2024-06-02 23:23:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:23:20] [INFO ] Applying decomposition
[2024-06-02 23:23:20] [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/graph7308335868508959267.txt' '-o' '/tmp/graph7308335868508959267.bin' '-w' '/tmp/graph7308335868508959267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7308335868508959267.bin' '-l' '-1' '-v' '-w' '/tmp/graph7308335868508959267.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:23:20] [INFO ] Decomposing Gal with order
[2024-06-02 23:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:23:20] [INFO ] Removed a total of 418 redundant transitions.
[2024-06-02 23:23:20] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 4 ms.
[2024-06-02 23:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3493158999656655046.gal : 17 ms
[2024-06-02 23:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13645682437802040868.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/CTLFireability3493158999656655046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13645682437802040868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06715e+09,3.48432,117892,1166,63,154415,1030,774,710763,83,3563,0


Converting to forward existential form...Done !
original formula: AF(AG(((i4.i0.u5.p51==0)||(i4.i1.u23.p153==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i4.i0.u5.p51==0)||(i4.i1.u23.p153==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t75, t89, t92, t96, t97, t102, t103, t105, t109, t128, t136, t161, t171, t172, t174, t194, t1...969
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 220 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 309 transition count 535
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 268 transition count 532
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 267 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 266 transition count 531
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 89 place count 266 transition count 507
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 137 place count 242 transition count 507
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 150 place count 229 transition count 450
Iterating global reduction 4 with 13 rules applied. Total rules applied 163 place count 229 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 229 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 164 place count 229 transition count 447
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 227 transition count 447
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 172 place count 223 transition count 440
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 223 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 223 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 222 transition count 438
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 181 place count 220 transition count 435
Iterating global reduction 7 with 2 rules applied. Total rules applied 183 place count 220 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 185 place count 220 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 186 place count 219 transition count 433
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 187 place count 218 transition count 430
Iterating global reduction 9 with 1 rules applied. Total rules applied 188 place count 218 transition count 430
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 189 place count 217 transition count 428
Iterating global reduction 9 with 1 rules applied. Total rules applied 190 place count 217 transition count 428
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 191 place count 216 transition count 425
Iterating global reduction 9 with 1 rules applied. Total rules applied 192 place count 216 transition count 425
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 193 place count 215 transition count 423
Iterating global reduction 9 with 1 rules applied. Total rules applied 194 place count 215 transition count 423
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 195 place count 214 transition count 420
Iterating global reduction 9 with 1 rules applied. Total rules applied 196 place count 214 transition count 420
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 197 place count 213 transition count 418
Iterating global reduction 9 with 1 rules applied. Total rules applied 198 place count 213 transition count 418
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 199 place count 212 transition count 416
Iterating global reduction 9 with 1 rules applied. Total rules applied 200 place count 212 transition count 416
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 201 place count 211 transition count 414
Iterating global reduction 9 with 1 rules applied. Total rules applied 202 place count 211 transition count 414
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 234 place count 195 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 236 place count 195 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 237 place count 194 transition count 396
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 239 place count 192 transition count 374
Iterating global reduction 11 with 2 rules applied. Total rules applied 241 place count 192 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 242 place count 192 transition count 373
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 243 place count 191 transition count 372
Applied a total of 243 rules in 77 ms. Remains 191 /318 variables (removed 127) and now considering 372/586 (removed 214) transitions.
[2024-06-02 23:23:50] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
// Phase 1: matrix 368 rows 191 cols
[2024-06-02 23:23:50] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:23:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:23:50] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2024-06-02 23:23:50] [INFO ] Invariant cache hit.
[2024-06-02 23:23:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:23:51] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 23:23:51] [INFO ] Redundant transitions in 2 ms returned []
Running 363 sub problems to find dead transitions.
[2024-06-02 23:23:51] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2024-06-02 23:23:51] [INFO ] Invariant cache hit.
[2024-06-02 23:23:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:23:52] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:23:53] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 131 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:23:54] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 367/556 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:24:01] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 2/558 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/559 variables, and 210 constraints, problems are : Problem set: 0 solved, 363 unsolved in 22741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 367/556 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 363/572 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:24:19] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 2/558 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/559 variables, and 577 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 14/14 constraints]
After SMT, in 52907ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 52911ms
Starting structural reductions in SI_CTL mode, iteration 1 : 191/318 places, 372/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53351 ms. Remains : 191/318 places, 372/586 transitions.
[2024-06-02 23:24:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:24:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:43] [INFO ] Input system was already deterministic with 372 transitions.
[2024-06-02 23:24:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9956053075675873020.gal : 2 ms
[2024-06-02 23:24:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7107441963486989298.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/CTLFireability9956053075675873020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7107441963486989298.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14891e+09,9.09897,240872,2,11689,5,555891,6,0,1132,1.00042e+06,0


Converting to forward existential form...Done !
original formula: EF((A(EG((p200==1)) U !((EF((p259==1)) + !(((p404==1)||((p51==1)&&(p419==1))))))) + (p219==1)))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!((E(TRUE U (p259==1)) + !(((p404==1)||((p51==1)&&(p419==1)))))))))) * !(E(!(!((E(T...362
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t24, t33, t36, t38, t43, t45, t46, t48, t69, t75, t77, t79, t80, t85, t87, t93, t95, ...777
Detected timeout of ITS tools.
[2024-06-02 23:25:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:25:14] [INFO ] Applying decomposition
[2024-06-02 23:25:14] [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/graph4429503827419921796.txt' '-o' '/tmp/graph4429503827419921796.bin' '-w' '/tmp/graph4429503827419921796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4429503827419921796.bin' '-l' '-1' '-v' '-w' '/tmp/graph4429503827419921796.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:25:14] [INFO ] Decomposing Gal with order
[2024-06-02 23:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:25:14] [INFO ] Removed a total of 458 redundant transitions.
[2024-06-02 23:25:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:25:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 4 ms.
[2024-06-02 23:25:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9244380963556787625.gal : 3 ms
[2024-06-02 23:25:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5525436033832629578.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/CTLFireability9244380963556787625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5525436033832629578.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14891e+09,5.85028,152560,1571,108,213081,1405,853,636298,91,6308,0


Converting to forward existential form...Done !
original formula: EF((A(EG((i6.u34.p200==1)) U !((EF((i7.u37.p259==1)) + !(((i0.i1.u69.p404==1)||((i1.i0.u6.p51==1)&&(i5.i0.u48.p419==1))))))) + (i6.u36.p2...163
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!((E(TRUE U (i7.u37.p259==1)) + !(((i0.i1.u69.p404==1)||((i1.i0.u6.p51==1)&&(i5.i0....484
Reverse transition relation is NOT exact ! Due to transitions t36, t93, t96, t100, t101, t106, t107, t109, t124, t127, t129, t135, t140, t197, t198, t200, ...1070
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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 an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,24.998,513424,1,0,701688,2891,4940,2.17237e+06,454,14010,1300125
FORMULA FireWire-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 296 transition count 518
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 296 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 296 transition count 516
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 288 transition count 485
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 288 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 288 transition count 484
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 283 transition count 474
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 283 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 283 transition count 473
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 281 transition count 468
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 281 transition count 468
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 279 transition count 463
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 279 transition count 463
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 277 transition count 458
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 277 transition count 458
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 275 transition count 453
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 275 transition count 453
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 274 transition count 451
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 274 transition count 451
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 273 transition count 449
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 273 transition count 449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 272 transition count 447
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 272 transition count 447
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 271 transition count 446
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 271 transition count 446
Applied a total of 98 rules in 23 ms. Remains 271 /318 variables (removed 47) and now considering 446/586 (removed 140) transitions.
// Phase 1: matrix 446 rows 271 cols
[2024-06-02 23:25:39] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:25:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 23:25:39] [INFO ] Invariant cache hit.
[2024-06-02 23:25:39] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-02 23:25:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:25:43] [INFO ] Deduced a trap composed of 166 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:25:43] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:25:44] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:25:44] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:25:44] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:25:44] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 446/717 variables, 271/286 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:25:53] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (OVERLAPS) 0/717 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 287 constraints, problems are : Problem set: 0 solved, 445 unsolved in 26115 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 446/717 variables, 271/287 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 445/732 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 154 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:26:16] [INFO ] Deduced a trap composed of 168 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:26:16] [INFO ] Deduced a trap composed of 161 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:26:16] [INFO ] Deduced a trap composed of 161 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:26:17] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 7/739 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:26:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/717 variables, and 740 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 17/17 constraints]
After SMT, in 56237ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 56242ms
Starting structural reductions in LTL mode, iteration 1 : 271/318 places, 446/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56683 ms. Remains : 271/318 places, 446/586 transitions.
[2024-06-02 23:26:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:35] [INFO ] Input system was already deterministic with 446 transitions.
[2024-06-02 23:26:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14888118826783689123.gal : 2 ms
[2024-06-02 23:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3909974499329621864.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/CTLFireability14888118826783689123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3909974499329621864.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.
Detected timeout of ITS tools.
[2024-06-02 23:27:06] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:27:06] [INFO ] Applying decomposition
[2024-06-02 23:27:06] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15337406489141582018.txt' '-o' '/tmp/graph15337406489141582018.bin' '-w' '/tmp/graph15337406489141582018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15337406489141582018.bin' '-l' '-1' '-v' '-w' '/tmp/graph15337406489141582018.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:27:06] [INFO ] Decomposing Gal with order
[2024-06-02 23:27:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:27:06] [INFO ] Removed a total of 469 redundant transitions.
[2024-06-02 23:27:06] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-06-02 23:27:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9848516517415862775.gal : 3 ms
[2024-06-02 23:27:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2062134867172346539.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/CTLFireability9848516517415862775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2062134867172346539.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 296 transition count 520
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 296 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 296 transition count 518
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 288 transition count 505
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 288 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 288 transition count 504
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 283 transition count 494
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 283 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 283 transition count 493
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 281 transition count 488
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 281 transition count 488
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 279 transition count 483
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 279 transition count 483
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 277 transition count 478
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 277 transition count 478
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 275 transition count 473
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 275 transition count 473
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 273 transition count 468
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 273 transition count 468
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 271 transition count 464
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 271 transition count 464
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 269 transition count 460
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 269 transition count 460
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 267 transition count 457
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 267 transition count 457
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 266 transition count 456
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 266 transition count 456
Applied a total of 108 rules in 23 ms. Remains 266 /318 variables (removed 52) and now considering 456/586 (removed 130) transitions.
// Phase 1: matrix 456 rows 266 cols
[2024-06-02 23:27:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:27:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:27:36] [INFO ] Invariant cache hit.
[2024-06-02 23:27:36] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-02 23:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:27:40] [INFO ] Deduced a trap composed of 157 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:27:40] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:27:40] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:27:41] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2024-06-02 23:27:41] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:27:41] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:27:41] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 3 ms to minimize.
[2024-06-02 23:27:42] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:27:44] [INFO ] Deduced a trap composed of 150 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:27:44] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (OVERLAPS) 456/722 variables, 266/283 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/722 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 283 constraints, problems are : Problem set: 0 solved, 455 unsolved in 24706 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 456/722 variables, 266/283 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 455/738 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:28:09] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:28:25] [INFO ] Deduced a trap composed of 147 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:28:28] [INFO ] Deduced a trap composed of 154 places in 99 ms of which 2 ms to minimize.
(s207 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 722/722 variables, and 741 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 13/13 constraints]
After SMT, in 54837ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 54840ms
Starting structural reductions in LTL mode, iteration 1 : 266/318 places, 456/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55184 ms. Remains : 266/318 places, 456/586 transitions.
[2024-06-02 23:28:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:28:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:28:31] [INFO ] Input system was already deterministic with 456 transitions.
[2024-06-02 23:28:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:28:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:28:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12471885081653341015.gal : 2 ms
[2024-06-02 23:28:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1680647102481358837.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/CTLFireability12471885081653341015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1680647102481358837.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.
Detected timeout of ITS tools.
[2024-06-02 23:29:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:29:01] [INFO ] Applying decomposition
[2024-06-02 23:29:01] [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/graph11926730184013237312.txt' '-o' '/tmp/graph11926730184013237312.bin' '-w' '/tmp/graph11926730184013237312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11926730184013237312.bin' '-l' '-1' '-v' '-w' '/tmp/graph11926730184013237312.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:29:01] [INFO ] Decomposing Gal with order
[2024-06-02 23:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:29:01] [INFO ] Removed a total of 487 redundant transitions.
[2024-06-02 23:29:01] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 4 ms.
[2024-06-02 23:29:01] [INFO ] Time to serialize gal into /tmp/CTLFireability482846421973167783.gal : 3 ms
[2024-06-02 23:29:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1624501458438972826.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/CTLFireability482846421973167783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1624501458438972826.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 297 transition count 538
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 297 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 297 transition count 537
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 289 transition count 524
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 289 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 289 transition count 523
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 284 transition count 513
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 284 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 284 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 282 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 282 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 280 transition count 502
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 280 transition count 502
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 278 transition count 497
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 278 transition count 497
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 276 transition count 492
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 276 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 274 transition count 487
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 274 transition count 487
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 272 transition count 483
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 272 transition count 483
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 270 transition count 479
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 270 transition count 479
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 268 transition count 476
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 268 transition count 476
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 267 transition count 475
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 267 transition count 475
Applied a total of 105 rules in 34 ms. Remains 267 /318 variables (removed 51) and now considering 475/586 (removed 111) transitions.
// Phase 1: matrix 475 rows 267 cols
[2024-06-02 23:29:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:29:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:29:31] [INFO ] Invariant cache hit.
[2024-06-02 23:29:32] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-06-02 23:29:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 168 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:29:38] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:29:38] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:29:39] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:29:39] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 475/742 variables, 267/286 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:29:46] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:30:00] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 288 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:30:04] [INFO ] Deduced a trap composed of 148 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:30:04] [INFO ] Deduced a trap composed of 148 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:30:04] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:30:05] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:30:05] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:30:05] [INFO ] Deduced a trap composed of 155 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:30:09] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (OVERLAPS) 475/742 variables, 267/298 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 474/772 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-02 23:30:19] [INFO ] Deduced a trap composed of 157 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:30:20] [INFO ] Deduced a trap composed of 158 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 2/774 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/742 variables, and 774 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 26/26 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 267/318 places, 475/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60556 ms. Remains : 267/318 places, 475/586 transitions.
[2024-06-02 23:30:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:30:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:30:32] [INFO ] Input system was already deterministic with 475 transitions.
[2024-06-02 23:30:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:30:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:30:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11286725145439098756.gal : 2 ms
[2024-06-02 23:30:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1214583276055353064.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/CTLFireability11286725145439098756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1214583276055353064.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.
Detected timeout of ITS tools.
[2024-06-02 23:31:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:31:02] [INFO ] Applying decomposition
[2024-06-02 23:31:02] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6246420017158712671.txt' '-o' '/tmp/graph6246420017158712671.bin' '-w' '/tmp/graph6246420017158712671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6246420017158712671.bin' '-l' '-1' '-v' '-w' '/tmp/graph6246420017158712671.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:31:02] [INFO ] Decomposing Gal with order
[2024-06-02 23:31:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:31:02] [INFO ] Removed a total of 534 redundant transitions.
[2024-06-02 23:31:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:31:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2024-06-02 23:31:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1096378622982501632.gal : 3 ms
[2024-06-02 23:31:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9606447156169892945.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/CTLFireability1096378622982501632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9606447156169892945.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,2.93009e+10,24.1642,545088,2645,69,843295,1248,966,2.83464e+06,82,3656,0


Converting to forward existential form...Done !
original formula: AG(A(!((EF(((i4.i0.u6.p41==1)&&(i9.u87.p370==1))) + EX(((i0.i1.u9.p52==1)&&(i0.i2.u35.p208==1))))) U !(((EX(AX(((i7.u61.p287==1)&&(i1.i3....322
=> equivalent forward existential formula: ([(EY((((FwdU(FwdU(Init,TRUE),!(!(((EX(!(EX(!(((i7.u61.p287==1)&&(i1.i3.u67.p312==1)))))) * !((((i9.u87.p369==1)...848
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t140, t147, t186, t188, t189, t191, t200, t202, t209, t236, t248, t249, t304, t321,...1177
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found 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 a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 295 transition count 517
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 295 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 295 transition count 515
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 286 transition count 482
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 286 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 286 transition count 481
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 281 transition count 471
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 281 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 279 transition count 465
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 279 transition count 465
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 277 transition count 460
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 275 transition count 455
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 275 transition count 455
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 273 transition count 450
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 273 transition count 450
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 271 transition count 445
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 269 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 267 transition count 437
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 267 transition count 437
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 265 transition count 434
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 264 transition count 433
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 264 transition count 433
Applied a total of 112 rules in 28 ms. Remains 264 /318 variables (removed 54) and now considering 433/586 (removed 153) transitions.
// Phase 1: matrix 433 rows 264 cols
[2024-06-02 23:31:32] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:31:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:31:32] [INFO ] Invariant cache hit.
[2024-06-02 23:31:32] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-02 23:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 162 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:31:38] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/278 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:31:44] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:31:50] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (OVERLAPS) 0/697 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 280 constraints, problems are : Problem set: 0 solved, 432 unsolved in 29786 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 432/712 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:32:10] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:32:10] [INFO ] Deduced a trap composed of 166 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:32:24] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:32:25] [INFO ] Deduced a trap composed of 160 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:32:25] [INFO ] Deduced a trap composed of 157 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:32:30] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 4/718 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 718 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 59914ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 59918ms
Starting structural reductions in LTL mode, iteration 1 : 264/318 places, 433/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60289 ms. Remains : 264/318 places, 433/586 transitions.
[2024-06-02 23:32:32] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:32:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:32:32] [INFO ] Input system was already deterministic with 433 transitions.
[2024-06-02 23:32:32] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:32:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9175816363427065466.gal : 3 ms
[2024-06-02 23:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16682668629818245533.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/CTLFireability9175816363427065466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16682668629818245533.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,2.46697e+10,26.2069,657136,2,23094,5,1.45499e+06,6,0,1489,3.17181e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:33:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:33:02] [INFO ] Applying decomposition
[2024-06-02 23:33:02] [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/graph14110142299815171638.txt' '-o' '/tmp/graph14110142299815171638.bin' '-w' '/tmp/graph14110142299815171638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14110142299815171638.bin' '-l' '-1' '-v' '-w' '/tmp/graph14110142299815171638.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:33:02] [INFO ] Decomposing Gal with order
[2024-06-02 23:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:33:02] [INFO ] Removed a total of 456 redundant transitions.
[2024-06-02 23:33:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2024-06-02 23:33:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9674733901208668059.gal : 3 ms
[2024-06-02 23:33:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17395877405856851222.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/CTLFireability9674733901208668059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17395877405856851222.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 LTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 299 transition count 560
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 299 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 299 transition count 559
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 292 transition count 531
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 292 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 292 transition count 530
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 290 transition count 525
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 290 transition count 525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 289 transition count 523
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 289 transition count 523
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 288 transition count 520
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 288 transition count 520
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 287 transition count 518
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 287 transition count 518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 286 transition count 515
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 286 transition count 515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 285 transition count 513
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 285 transition count 513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 284 transition count 511
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 284 transition count 511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 283 transition count 509
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 283 transition count 509
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 282 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 282 transition count 508
Applied a total of 74 rules in 31 ms. Remains 282 /318 variables (removed 36) and now considering 508/586 (removed 78) transitions.
// Phase 1: matrix 508 rows 282 cols
[2024-06-02 23:33:33] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 23:33:33] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:33:33] [INFO ] Invariant cache hit.
[2024-06-02 23:33:33] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2024-06-02 23:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 162 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 160 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 160 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 160 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:33:38] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:33:39] [INFO ] Deduced a trap composed of 159 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:33:39] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:33:39] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:33:39] [INFO ] Deduced a trap composed of 166 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:33:39] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:33:40] [INFO ] Deduced a trap composed of 165 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:33:40] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:33:40] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:33:43] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:33:44] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:33:49] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (OVERLAPS) 508/790 variables, 282/307 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/790 variables, and 307 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 508/790 variables, 282/307 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/790 variables, 507/814 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:34:12] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:34:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/790 variables, and 816 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 20/20 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 282/318 places, 508/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 282/318 places, 508/586 transitions.
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:34:33] [INFO ] Input system was already deterministic with 508 transitions.
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:34:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9523031943652031474.gal : 2 ms
[2024-06-02 23:34:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10223432064102876950.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/CTLFireability9523031943652031474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10223432064102876950.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.
Detected timeout of ITS tools.
[2024-06-02 23:35:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:35:03] [INFO ] Applying decomposition
[2024-06-02 23:35:03] [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/graph13773907179181321895.txt' '-o' '/tmp/graph13773907179181321895.bin' '-w' '/tmp/graph13773907179181321895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13773907179181321895.bin' '-l' '-1' '-v' '-w' '/tmp/graph13773907179181321895.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:35:03] [INFO ] Decomposing Gal with order
[2024-06-02 23:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:35:03] [INFO ] Removed a total of 559 redundant transitions.
[2024-06-02 23:35:03] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2024-06-02 23:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17175695189484877450.gal : 3 ms
[2024-06-02 23:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17738691908734958935.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/CTLFireability17175695189484877450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17738691908734958935.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 586/586 transitions.
Graph (trivial) has 208 edges and 318 vertex of which 11 / 318 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 309 transition count 539
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 272 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 271 transition count 536
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 79 place count 271 transition count 512
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 127 place count 247 transition count 512
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 140 place count 234 transition count 491
Iterating global reduction 3 with 13 rules applied. Total rules applied 153 place count 234 transition count 491
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 234 transition count 490
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 233 transition count 490
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 162 place count 226 transition count 478
Iterating global reduction 3 with 7 rules applied. Total rules applied 169 place count 226 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 226 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 225 transition count 476
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 177 place count 220 transition count 466
Iterating global reduction 5 with 5 rules applied. Total rules applied 182 place count 220 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 184 place count 220 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 219 transition count 464
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 187 place count 217 transition count 459
Iterating global reduction 7 with 2 rules applied. Total rules applied 189 place count 217 transition count 459
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 191 place count 215 transition count 454
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 215 transition count 454
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 195 place count 213 transition count 449
Iterating global reduction 7 with 2 rules applied. Total rules applied 197 place count 213 transition count 449
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 198 place count 212 transition count 446
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 212 transition count 446
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 200 place count 211 transition count 444
Iterating global reduction 7 with 1 rules applied. Total rules applied 201 place count 211 transition count 444
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 231 place count 196 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 233 place count 196 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 234 place count 195 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 235 place count 194 transition count 426
Applied a total of 235 rules in 45 ms. Remains 194 /318 variables (removed 124) and now considering 426/586 (removed 160) transitions.
[2024-06-02 23:35:33] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
// Phase 1: matrix 422 rows 194 cols
[2024-06-02 23:35:33] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:35:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:35:34] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2024-06-02 23:35:34] [INFO ] Invariant cache hit.
[2024-06-02 23:35:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:35:34] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-02 23:35:34] [INFO ] Redundant transitions in 2 ms returned []
Running 419 sub problems to find dead transitions.
[2024-06-02 23:35:34] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2024-06-02 23:35:34] [INFO ] Invariant cache hit.
[2024-06-02 23:35:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 2/192 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 23:35:37] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:35:37] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:35:37] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:35:38] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:35:38] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 67 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 118 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 23:35:42] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 421/613 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 23:35:50] [INFO ] Deduced a trap composed of 137 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 10 (OVERLAPS) 2/615 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 12 (OVERLAPS) 0/615 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/616 variables, and 215 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 2/192 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 421/613 variables, 192/211 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 419/632 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 10 (OVERLAPS) 2/615 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/616 variables, and 634 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 12/12 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/318 places, 426/586 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60513 ms. Remains : 194/318 places, 426/586 transitions.
[2024-06-02 23:36:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:36:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:36:34] [INFO ] Input system was already deterministic with 426 transitions.
[2024-06-02 23:36:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:36:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5090121658351267877.gal : 2 ms
[2024-06-02 23:36:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6153296003445729135.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/CTLFireability5090121658351267877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6153296003445729135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4909e+09,17.3353,368224,2,11709,5,817846,6,0,1198,1.56036e+06,0


Converting to forward existential form...Done !
original formula: E((!(((EG(((p41==1)&&(p435==1))) * (!(EG(((p37==1)&&(p408==1)))) + AG((p201==1)))) * !(E((((p46==1)&&(p220==1))||((p51==1)&&(p334==1))) U...267
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(((EG(((p41==1)&&(p435==1))) * (!(EG(((p37==1)&&(p408==1)))) + !(E(TRUE U !((p201==1)))))) * ...332
Reverse transition relation is NOT exact ! Due to transitions t2, t22, t25, t28, t32, t35, t39, t44, t46, t51, t58, t73, t76, t79, t81, t83, t84, t90, t92,...760
Detected timeout of ITS tools.
[2024-06-02 23:37:04] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:37:04] [INFO ] Applying decomposition
[2024-06-02 23:37:04] [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/graph9760192936201901421.txt' '-o' '/tmp/graph9760192936201901421.bin' '-w' '/tmp/graph9760192936201901421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9760192936201901421.bin' '-l' '-1' '-v' '-w' '/tmp/graph9760192936201901421.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:37:04] [INFO ] Decomposing Gal with order
[2024-06-02 23:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:37:04] [INFO ] Removed a total of 547 redundant transitions.
[2024-06-02 23:37:04] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:37:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 4 ms.
[2024-06-02 23:37:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1282091513749493961.gal : 2 ms
[2024-06-02 23:37:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6243643381301232769.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/CTLFireability1282091513749493961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6243643381301232769.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.
Detected timeout of ITS tools.
[2024-06-02 23:37:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:37:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:37:34] [INFO ] Applying decomposition
[2024-06-02 23:37:34] [INFO ] Flatten gal took : 13 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/graph15575743439616804626.txt' '-o' '/tmp/graph15575743439616804626.bin' '-w' '/tmp/graph15575743439616804626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15575743439616804626.bin' '-l' '-1' '-v' '-w' '/tmp/graph15575743439616804626.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:37:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:37:34] [INFO ] Removed a total of 678 redundant transitions.
[2024-06-02 23:37:34] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 4 ms.
[2024-06-02 23:37:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14999066051354863086.gal : 4 ms
[2024-06-02 23:37:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4152081112945458052.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/CTLFireability14999066051354863086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4152081112945458052.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 11 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.34484e+10,65.6136,1387040,3946,150,1.3007e+06,2677,1241,1.16853e+07,124,11088,0


Converting to forward existential form...Done !
original formula: AF((A(((i9.i2.u98.p435==1)||((i9.i0.u9.p37==1)&&(i1.u46.p174==1))) U ((i7.i2.u76.p357==1)&&(i5.u53.p218==1))) + EF(((i6.i0.u65.p259==1)||...199
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((i7.i2.u76.p357==1)&&(i5.u53.p218==1))) U (!(((i9.i2.u98.p435==1)||((i9.i0.u9.p37==1)&&(i1...357
Reverse transition relation is NOT exact ! Due to transitions t28, t72, t141, t158, t165, t201, t215, t224, t227, t239, t240, t242, t246, t275, t276, t289,...1548
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,404.3,2745800,1,0,1.70249e+06,4083,3733,2.75566e+07,301,17115,2576560
FORMULA FireWire-PT-18-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((AG(((i8.i0.u4.p12==0)||(i8.i0.u79.p328==0))) + EG(AG(((i9.i0.u8.p41==1)&&(i9.i2.u97.p376==1))))) + (((i6.i0.u72.p295==1)&&(i10.i0.u1...276
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(((i8.i0.u4.p12==0)||(i8.i0.u79.p328==0))))))] != FALSE + [FwdG(FwdU(Init,TRUE...412
(forward)formula 1,1,515.952,3067616,1,0,1.91831e+06,4083,3722,3.07156e+07,300,17115,2565644
FORMULA FireWire-PT-18-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AG((EG(((i8.i0.u11.p51==0)||(i8.i1.u85.p341==0))) + ((AX(((i7.i1.u69.p287==0)||(i7.i2.u90.p317==0))) * (i0.i0.u1.p58==1)) * ((i1.u48.p...236
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG(((i8.i0.u11.p51==0)||(i8.i1.u85.p341==0))) + ((!(EX(!(((i7.i1.u69.p287==0)|...306
(forward)formula 2,1,882.67,4501136,1,0,2.8547e+06,4088,3854,4.67349e+07,310,17613,3652505
FORMULA FireWire-PT-18-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

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

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