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.r356-tall-171683760600218.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 ShieldIIPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760600218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 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 ShieldIIPt-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716925449208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 19:44:10] [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-05-28 19:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:44:10] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-28 19:44:10] [INFO ] Transformed 213 places.
[2024-05-28 19:44:10] [INFO ] Transformed 198 transitions.
[2024-05-28 19:44:10] [INFO ] Found NUPN structural information;
[2024-05-28 19:44:10] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 120 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 206 transition count 191
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 191
Applied a total of 14 rules in 30 ms. Remains 206 /213 variables (removed 7) and now considering 191/198 (removed 7) transitions.
// Phase 1: matrix 191 rows 206 cols
[2024-05-28 19:44:10] [INFO ] Computed 28 invariants in 17 ms
[2024-05-28 19:44:10] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-28 19:44:10] [INFO ] Invariant cache hit.
[2024-05-28 19:44:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 19:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 10 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 4 ms to minimize.
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 191/397 variables, 206/273 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:44:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/397 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/397 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/397 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 0/397 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 288 constraints, problems are : Problem set: 0 solved, 190 unsolved in 24002 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:36] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/397 variables, 206/289 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 190/479 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:44:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:44:39] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:44:39] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:41] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:44:41] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-28 19:44:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 7/495 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:45] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:44:45] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:47] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-28 19:44:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:44:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-28 19:44:48] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:50] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:44:51] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:44:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:44:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:44:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:44:53] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 19:45:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/397 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 508 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 84/84 constraints]
After SMT, in 54087ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 54101ms
Starting structural reductions in LTL mode, iteration 1 : 206/213 places, 191/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54547 ms. Remains : 206/213 places, 191/198 transitions.
Support contains 120 out of 206 places after structural reductions.
[2024-05-28 19:45:05] [INFO ] Flatten gal took : 33 ms
[2024-05-28 19:45:05] [INFO ] Flatten gal took : 13 ms
[2024-05-28 19:45:05] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 40000 steps (8 resets) in 1408 ms. (28 steps per ms) remains 7/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
[2024-05-28 19:45:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/166 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/206 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 191/397 variables, 206/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/397 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/166 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp96 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 6/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/206 variables, 6/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 191/397 variables, 206/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 3/244 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 4/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/397 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 248 constraints, problems are : Problem set: 1 solved, 3 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 937ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 616 ms.
Support contains 12 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 191/191 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 38 place count 206 transition count 153
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 168 transition count 151
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 167 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 164 transition count 148
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 85 place count 164 transition count 134
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 113 place count 150 transition count 134
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 128 place count 135 transition count 119
Iterating global reduction 4 with 15 rules applied. Total rules applied 143 place count 135 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 143 place count 135 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 157 place count 128 transition count 112
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 251 place count 81 transition count 65
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 265 place count 74 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 74 transition count 68
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 74 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 73 transition count 67
Applied a total of 269 rules in 60 ms. Remains 73 /206 variables (removed 133) and now considering 67/191 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 73/206 places, 67/191 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 542155 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 3
Probabilistic random walk after 542155 steps, saw 334052 distinct states, run finished after 3010 ms. (steps per millisecond=180 ) properties seen :0
// Phase 1: matrix 67 rows 73 cols
[2024-05-28 19:45:11] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:45:11] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/57 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 54/111 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16/127 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/140 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 112 constraints, problems are : Problem set: 0 solved, 3 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 73/73 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/57 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 11/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/127 variables, 8/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/140 variables, 8/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 4/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 119 constraints, problems are : Problem set: 1 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 73/73 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 298ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 67/67 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 73 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 71 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 70 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 67 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 66 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 65 transition count 61
Applied a total of 15 rules in 11 ms. Remains 65 /73 variables (removed 8) and now considering 61/67 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 65/73 places, 61/67 transitions.
RANDOM walk for 40000 steps (9 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 705821 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 705821 steps, saw 400240 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
// Phase 1: matrix 61 rows 65 cols
[2024-05-28 19:45:14] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:45:14] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/36 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/77 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/103 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/106 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/126 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/126 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/126 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/36 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:45:14] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:45:14] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/103 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/106 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/106 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 20/126 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/126 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/126 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/126 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 19:45:14] [INFO ] Invariant cache hit.
[2024-05-28 19:45:14] [INFO ] Implicit Places using invariants in 42 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/65 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 64 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 60
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 63 cols
[2024-05-28 19:45:14] [INFO ] Computed 27 invariants in 1 ms
[2024-05-28 19:45:14] [INFO ] Implicit Places using invariants in 51 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/65 places, 60/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 61 cols
[2024-05-28 19:45:14] [INFO ] Computed 26 invariants in 0 ms
[2024-05-28 19:45:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 19:45:14] [INFO ] Invariant cache hit.
[2024-05-28 19:45:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 19:45:14] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 61/65 places, 59/61 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 219 ms. Remains : 61/65 places, 59/61 transitions.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 842137 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 2
Probabilistic random walk after 842137 steps, saw 457934 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2024-05-28 19:45:18] [INFO ] Invariant cache hit.
[2024-05-28 19:45:18] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/71 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/97 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/100 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/120 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/120 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 39/71 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/97 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/98 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/100 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 20/120 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/120 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/120 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 19:45:18] [INFO ] Invariant cache hit.
[2024-05-28 19:45:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 19:45:18] [INFO ] Invariant cache hit.
[2024-05-28 19:45:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 19:45:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-28 19:45:18] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-28 19:45:18] [INFO ] Invariant cache hit.
[2024-05-28 19:45:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 59/120 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 56 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 59/120 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 56/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
After SMT, in 1762ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1877 ms. Remains : 61/61 places, 59/59 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 151 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 60 transition count 59
Applied a total of 9 rules in 13 ms. Remains 60 /61 variables (removed 1) and now considering 59/59 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 59 rows 60 cols
[2024-05-28 19:45:20] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 19:45:20] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-05-28 19:45:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:45:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2024-05-28 19:45:20] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:45:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 19:45:20] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 19:45:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:45:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-05-28 19:45:20] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:45:20] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 194 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-28 19:45:20] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:45:20] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:45:20] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 56 stabilizing places and 56 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Applied a total of 54 rules in 12 ms. Remains 179 /206 variables (removed 27) and now considering 164/191 (removed 27) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-28 19:45:20] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:45:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:45:20] [INFO ] Invariant cache hit.
[2024-05-28 19:45:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-28 19:45:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:21] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:45:21] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:45:21] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:45:21] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:45:21] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:25] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 233 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8182 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:29] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:30] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 164/343 variables, 179/235 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 163/398 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:45:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:45:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 19:45:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:45:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 12/410 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:36] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:45:36] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:45:36] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:45:38] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:45:39] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (OVERLAPS) 0/343 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 420 constraints, problems are : Problem set: 0 solved, 163 unsolved in 16012 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 50/50 constraints]
After SMT, in 24210ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 24212ms
Starting structural reductions in LTL mode, iteration 1 : 179/206 places, 164/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24370 ms. Remains : 179/206 places, 164/191 transitions.
[2024-05-28 19:45:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:45:45] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:45:45] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-28 19:45:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:45:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:45:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4563705916102940249.gal : 3 ms
[2024-05-28 19:45:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11622200113836724728.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/CTLFireability4563705916102940249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11622200113836724728.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.29062e+17,2.76354,101248,2,2463,5,293943,6,0,882,679804,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(((p201==1)||(p143==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(((p201==1)||(p143==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t49, t54, t58, t62,...405
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:46:15] [INFO ] Flatten gal took : 13 ms
[2024-05-28 19:46:15] [INFO ] Applying decomposition
[2024-05-28 19:46:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13874201673879957390.txt' '-o' '/tmp/graph13874201673879957390.bin' '-w' '/tmp/graph13874201673879957390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13874201673879957390.bin' '-l' '-1' '-v' '-w' '/tmp/graph13874201673879957390.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:46:15] [INFO ] Decomposing Gal with order
[2024-05-28 19:46:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:46:15] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 19:46:15] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:46:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 19:46:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14195894443951910381.gal : 4 ms
[2024-05-28 19:46:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11652061702438476501.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/CTLFireability14195894443951910381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11652061702438476501.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.29062e+17,0.741732,30456,543,29,47446,299,440,137469,47,671,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(((i14.u63.p201==1)||(i8.u43.p143==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(((i14.u63.p201==1)||(i8.u43.p143==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t82, t126, i0.t97, i0.u22.t93, i1.t130, i1.i0.u7.t132, i1.i1.t128, i1.i1.u6.t133, i...703
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 186 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 186 transition count 171
Applied a total of 40 rules in 10 ms. Remains 186 /206 variables (removed 20) and now considering 171/191 (removed 20) transitions.
// Phase 1: matrix 171 rows 186 cols
[2024-05-28 19:46:45] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:46:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 19:46:45] [INFO ] Invariant cache hit.
[2024-05-28 19:46:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-28 19:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:46:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:46:47] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:46:48] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:46:49] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:46:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/357 variables, 186/249 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/357 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 251 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9815 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/357 variables, 186/252 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 170/422 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:46:57] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 19:46:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 4/431 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:47:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 19:47:06] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 7/439 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:13] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/357 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-28 19:47:20] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 170 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 357/357 variables, and 444 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 60/60 constraints]
After SMT, in 39841ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 39847ms
Starting structural reductions in LTL mode, iteration 1 : 186/206 places, 171/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40033 ms. Remains : 186/206 places, 171/191 transitions.
[2024-05-28 19:47:25] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:47:25] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:47:25] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-28 19:47:25] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:47:25] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:47:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4036007924683198913.gal : 2 ms
[2024-05-28 19:47:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17322846871699582981.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/CTLFireability4036007924683198913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17322846871699582981.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,4.90966e+17,6.12306,194060,2,3716,5,525108,6,0,917,1.38484e+06,0


Converting to forward existential form...Done !
original formula: ((AX(AG(EX((p50==1)))) + ((AG(((EG(((p129==0)||(p87==0))) + (p33==0)) + (p99==1))) * E(((p30==1)&&(p122==1)) U EF((p140==1)))) * !(E(AG(A...284
=> equivalent forward existential formula: ([(FwdU((Init * !((!(EX(!(!(E(TRUE U !(EX((p50==1)))))))) + ((!(E(TRUE U !(((EG(((p129==0)||(p87==0))) + (p33==0...786
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t29, t33, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...461
Detected timeout of ITS tools.
[2024-05-28 19:47:55] [INFO ] Flatten gal took : 14 ms
[2024-05-28 19:47:55] [INFO ] Applying decomposition
[2024-05-28 19:47:55] [INFO ] Flatten gal took : 5 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/graph15422692599785965906.txt' '-o' '/tmp/graph15422692599785965906.bin' '-w' '/tmp/graph15422692599785965906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15422692599785965906.bin' '-l' '-1' '-v' '-w' '/tmp/graph15422692599785965906.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:47:55] [INFO ] Decomposing Gal with order
[2024-05-28 19:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:47:55] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-28 19:47:55] [INFO ] Flatten gal took : 12 ms
[2024-05-28 19:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:47:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8830461109596435953.gal : 3 ms
[2024-05-28 19:47:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17318652607578313049.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/CTLFireability8830461109596435953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17318652607578313049.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,4.90966e+17,0.827008,31284,765,40,48297,659,475,140446,58,1425,0


Converting to forward existential form...Done !
original formula: ((AX(AG(EX((i4.u19.p50==1)))) + ((AG(((EG(((i8.u42.p129==0)||(i6.i0.u30.p87==0))) + (i3.u13.p33==0)) + (i7.u36.p99==1))) * E(((i3.u11.p30...409
=> equivalent forward existential formula: ([(FwdU((Init * !((!(EX(!(!(E(TRUE U !(EX((i4.u19.p50==1)))))))) + ((!(E(TRUE U !(((EG(((i8.u42.p129==0)||(i6.i0...1022
Reverse transition relation is NOT exact ! Due to transitions t44, t90, t133, i0.i0.u10.t134, i0.i1.t107, i0.i1.u20.t111, i1.t102, i1.u23.t97, i1.u25.t98, ...831
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 5 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:48:25] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:48:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 19:48:25] [INFO ] Invariant cache hit.
[2024-05-28 19:48:25] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:48:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:48:28] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:48:28] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/345 variables, 180/233 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:48:31] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:48:31] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/345 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 237 constraints, problems are : Problem set: 0 solved, 164 unsolved in 10756 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/345 variables, 180/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 164/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:48:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:48:44] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:48:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 424 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17455 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 52/52 constraints]
After SMT, in 28223ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 28225ms
Starting structural reductions in LTL mode, iteration 1 : 180/206 places, 165/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28377 ms. Remains : 180/206 places, 165/191 transitions.
[2024-05-28 19:48:54] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:48:54] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:48:54] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:48:54] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:48:54] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:48:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4124689075760138742.gal : 1 ms
[2024-05-28 19:48:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8430870760079163399.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/CTLFireability4124689075760138742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8430870760079163399.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,2.55333e+17,2.85535,103220,2,2578,5,301429,6,0,887,698379,0


Converting to forward existential form...Done !
original formula: EX(A(!(((p90==1)&&(p92==1))) U !(A(((p52==1) + EG((p15==1))) U !(((p94==1)&&(p172==1)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(!((E(!(!(((p94==1)&&(p172==1)))) U (!(((p52==1) + EG((p15==1)))) * !(!(((p94==1)&&(p172==...533
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t32, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...411
Detected timeout of ITS tools.
[2024-05-28 19:49:24] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:49:24] [INFO ] Applying decomposition
[2024-05-28 19:49:24] [INFO ] Flatten gal took : 5 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/graph2876529543412801658.txt' '-o' '/tmp/graph2876529543412801658.bin' '-w' '/tmp/graph2876529543412801658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2876529543412801658.bin' '-l' '-1' '-v' '-w' '/tmp/graph2876529543412801658.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:49:24] [INFO ] Decomposing Gal with order
[2024-05-28 19:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:49:24] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-28 19:49:24] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:49:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1920773553155003093.gal : 3 ms
[2024-05-28 19:49:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18135741680427678777.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/CTLFireability1920773553155003093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18135741680427678777.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.55333e+17,0.383816,19892,492,29,28438,307,453,88457,48,737,0


Converting to forward existential form...Done !
original formula: EX(A(!(((i6.i1.u27.p90==1)&&(i6.i1.u27.p92==1))) U !(A(((i4.u17.p52==1) + EG((i1.i1.u5.p15==1))) U !(((i6.i0.u29.p94==1)&&(i12.u54.p172==...163
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(!((E(!(!(((i6.i0.u29.p94==1)&&(i12.u54.p172==1)))) U (!(((i4.u17.p52==1) + EG((i1.i1.u5.p...763
Reverse transition relation is NOT exact ! Due to transitions t43, t83, t131, i1.t129, i1.i0.u1.t135, i1.i0.u8.t130, i1.i1.t127, i1.i1.u5.t134, i1.i1.u9.t1...714
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 12 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:49:54] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:49:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 19:49:54] [INFO ] Invariant cache hit.
[2024-05-28 19:49:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:49:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/345 variables, 180/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:50:01] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:50:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 245 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9402 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/247 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 164/411 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:50:08] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:50:08] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 423 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11688 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 51/51 constraints]
After SMT, in 21108ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 21110ms
Starting structural reductions in LTL mode, iteration 1 : 180/206 places, 165/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21283 ms. Remains : 180/206 places, 165/191 transitions.
[2024-05-28 19:50:15] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:50:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:15] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:50:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4831776139044310543.gal : 1 ms
[2024-05-28 19:50:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13498696798823292690.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/CTLFireability4831776139044310543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13498696798823292690.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.73152e+17,3.03953,108208,2,3054,5,315326,6,0,887,738556,0


Converting to forward existential form...Done !
original formula: (AF(((((AF(((p155==1)&&(p183==1))) * AF((p84==0))) * ((p160==1)&&(p199==1))) + EG((p185==1))) * (p78==1))) + AG((EF(((p198==1) + EX((p168...225
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!(((((!(EG(!(((p155==1)&&(p183==1))))) * !(EG(!((p84==0))))) * ((p160==1)&&(p199==1))) + ...750
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t20, t22, t25, t29, t32, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54,...415
Detected timeout of ITS tools.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:45] [INFO ] Applying decomposition
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 4 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/graph4402514985912207360.txt' '-o' '/tmp/graph4402514985912207360.bin' '-w' '/tmp/graph4402514985912207360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4402514985912207360.bin' '-l' '-1' '-v' '-w' '/tmp/graph4402514985912207360.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:50:45] [INFO ] Decomposing Gal with order
[2024-05-28 19:50:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:50:45] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:50:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8111102717519217496.gal : 2 ms
[2024-05-28 19:50:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3380529885127500837.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/CTLFireability8111102717519217496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3380529885127500837.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.73152e+17,0.237449,14128,571,29,21492,316,443,41615,49,857,0


Converting to forward existential form...Done !
original formula: (AF(((((AF(((i12.i0.u50.p155==1)&&(i12.i1.u59.p183==1))) * AF((i5.i0.u27.p84==0))) * ((i12.i0.u51.p160==1)&&(i9.i1.u63.p199==1))) + EG((i...352
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!(((((!(EG(!(((i12.i0.u50.p155==1)&&(i12.i1.u59.p183==1))))) * !(EG(!((i5.i0.u27.p84==0))...1077
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t83, t87, t129, t131, i0.i1.t127, i0.i1.u5.t134, i0.i1.u9.t128, i0.i2.t98, i0.i2.u2...738
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 11 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:51:15] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:51:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 19:51:15] [INFO ] Invariant cache hit.
[2024-05-28 19:51:15] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:51:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:51:16] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:51:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:51:18] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:51:18] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:51:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/232 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:51:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:51:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 237 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8375 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/345 variables, 180/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 164/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:25] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:51:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 422 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17609 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 50/50 constraints]
After SMT, in 25997ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 25998ms
Starting structural reductions in LTL mode, iteration 1 : 180/206 places, 165/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26166 ms. Remains : 180/206 places, 165/191 transitions.
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:51:41] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:51:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1646933247725090167.gal : 1 ms
[2024-05-28 19:51:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9801715027612862843.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/CTLFireability1646933247725090167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9801715027612862843.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,2.98611e+17,3.85446,129400,2,2551,5,366128,6,0,887,901593,0


Converting to forward existential form...Done !
original formula: EG(((AX(AG((p110==0))) * EX(!(E((p176==1) U (p75==1))))) + (AF(E((((p83==1)&&(p137==1))||(p99==1)) U AF((p1==1)))) * EF((p113==0)))))
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(E(TRUE U !((p110==0))))))) * EX(!(E((p176==1) U (p75==1))))) + (!(EG(!(E((((p83==1)&&(p137...230
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t32, t34, t35, t37, t38, t39, t40, t41, t42, t44, t45, t49, t53,...420
Detected timeout of ITS tools.
[2024-05-28 19:52:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:52:11] [INFO ] Applying decomposition
[2024-05-28 19:52:11] [INFO ] Flatten gal took : 6 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/graph13511479517608382717.txt' '-o' '/tmp/graph13511479517608382717.bin' '-w' '/tmp/graph13511479517608382717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13511479517608382717.bin' '-l' '-1' '-v' '-w' '/tmp/graph13511479517608382717.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:52:11] [INFO ] Decomposing Gal with order
[2024-05-28 19:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:52:11] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-28 19:52:11] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 19:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16104337684964501874.gal : 2 ms
[2024-05-28 19:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6873850280866341932.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/CTLFireability16104337684964501874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6873850280866341932.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.98611e+17,0.467731,20976,519,38,33089,447,479,70840,58,1191,0


Converting to forward existential form...Done !
original formula: EG(((AX(AG((i8.u32.p110==0))) * EX(!(E((i13.u55.p176==1) U (i0.i1.u23.p75==1))))) + (AF(E((((i7.i0.u27.p83==1)&&(i10.u44.p137==1))||(i8.u...217
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(E(TRUE U !((i8.u32.p110==0))))))) * EX(!(E((i13.u55.p176==1) U (i0.i1.u23.p75==1))))) + (!...296
Reverse transition relation is NOT exact ! Due to transitions t38, t42, t83, t127, i0.i0.u1.t135, i0.i2.u31.t84, i1.i0.u10.t128, i1.i1.u21.t94, i1.i1.u21.t...748
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 205 transition count 143
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 158 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 157 transition count 141
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 97 place count 157 transition count 127
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 125 place count 143 transition count 127
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 142 place count 126 transition count 110
Iterating global reduction 3 with 17 rules applied. Total rules applied 159 place count 126 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 159 place count 126 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 179 place count 116 transition count 100
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 267 place count 72 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 70 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 68 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 68 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 67 transition count 53
Applied a total of 273 rules in 19 ms. Remains 67 /206 variables (removed 139) and now considering 53/191 (removed 138) transitions.
// Phase 1: matrix 53 rows 67 cols
[2024-05-28 19:52:42] [INFO ] Computed 26 invariants in 1 ms
[2024-05-28 19:52:42] [INFO ] Implicit Places using invariants in 44 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/206 places, 53/191 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 52
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 65 cols
[2024-05-28 19:52:42] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 19:52:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 19:52:42] [INFO ] Invariant cache hit.
[2024-05-28 19:52:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 65/206 places, 52/191 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 159 ms. Remains : 65/206 places, 52/191 transitions.
[2024-05-28 19:52:42] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:52:42] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:52:42] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-28 19:52:42] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:52:42] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:52:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17038504816175922685.gal : 1 ms
[2024-05-28 19:52:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17429458137461921212.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/CTLFireability17038504816175922685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17429458137461921212.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,4.53496e+09,0.041974,5676,2,271,5,9451,6,0,314,12134,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((p80==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((p80==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t18, t20, t21, t23, t26, t38, t47, Intersection with reachable at each ste...213
Detected timeout of ITS tools.
[2024-05-28 19:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:53:12] [INFO ] Applying decomposition
[2024-05-28 19:53:12] [INFO ] Flatten gal took : 2 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/graph2445816093770223748.txt' '-o' '/tmp/graph2445816093770223748.bin' '-w' '/tmp/graph2445816093770223748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2445816093770223748.bin' '-l' '-1' '-v' '-w' '/tmp/graph2445816093770223748.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:53:12] [INFO ] Decomposing Gal with order
[2024-05-28 19:53:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:53:12] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-28 19:53:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5830856696382258126.gal : 1 ms
[2024-05-28 19:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9315147156201043318.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/CTLFireability5830856696382258126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9315147156201043318.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,4.53496e+09,0.021716,4480,62,20,1800,120,157,3102,36,445,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((i6.u9.p80==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((i6.u9.p80==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t38, i0.u7.t20, i1.u8.t21, i2.u16.t26, i3.u5.t18, i4.u2.t0, i4.u6.t9, i5.u15.t12, i5.u17.t14,...274
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,1,1.16921,50152,1,0,81860,207,807,189125,179,826,76040
FORMULA ShieldIIPt-PT-003B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Applied a total of 54 rules in 6 ms. Remains 179 /206 variables (removed 27) and now considering 164/191 (removed 27) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-28 19:53:13] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:53:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 19:53:13] [INFO ] Invariant cache hit.
[2024-05-28 19:53:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-28 19:53:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:53:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:53:19] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:53:20] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:22] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:53:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (OVERLAPS) 0/343 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 243 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11721 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 36/64 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/343 variables, 179/243 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 163/406 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:26] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:53:27] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:53:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:53:27] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:53:27] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:53:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 6/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:29] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:53:29] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:53:29] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:53:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:53:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:53:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 163 unsolved in 15456 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 49/49 constraints]
After SMT, in 27188ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 27190ms
Starting structural reductions in LTL mode, iteration 1 : 179/206 places, 164/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27348 ms. Remains : 179/206 places, 164/191 transitions.
[2024-05-28 19:53:40] [INFO ] Flatten gal took : 12 ms
[2024-05-28 19:53:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:40] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-28 19:53:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:53:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15323285633513036201.gal : 1 ms
[2024-05-28 19:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11215429431891991899.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/CTLFireability15323285633513036201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11215429431891991899.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.60391e+17,3.31737,115436,2,2613,5,334475,6,0,882,803205,0


Converting to forward existential form...Done !
original formula: EG(AX((p65==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((p65==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...410
Detected timeout of ITS tools.
[2024-05-28 19:54:10] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:54:10] [INFO ] Applying decomposition
[2024-05-28 19:54:10] [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/graph5856975995162191582.txt' '-o' '/tmp/graph5856975995162191582.bin' '-w' '/tmp/graph5856975995162191582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5856975995162191582.bin' '-l' '-1' '-v' '-w' '/tmp/graph5856975995162191582.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:54:10] [INFO ] Decomposing Gal with order
[2024-05-28 19:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:54:10] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 19:54:10] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3652480319828377303.gal : 2 ms
[2024-05-28 19:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8217192166358075709.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/CTLFireability3652480319828377303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8217192166358075709.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.60391e+17,0.47576,22996,552,29,40065,366,427,80410,49,952,0


Converting to forward existential form...Done !
original formula: EG(AX((i5.u20.p65==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((i5.u20.p65==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t85, t126, i0.u9.t127, i1.i0.u1.t134, i2.t130, i2.i0.t128, i2.i0.u5.t133, i2.i0.u8.t129,...680
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 205 transition count 151
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 166 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 165 transition count 150
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 80 place count 165 transition count 136
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 108 place count 151 transition count 136
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 122 place count 137 transition count 122
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 137 transition count 122
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 136 place count 137 transition count 113
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 128 transition count 113
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 240 place count 85 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 83 transition count 68
Applied a total of 242 rules in 22 ms. Remains 83 /206 variables (removed 123) and now considering 68/191 (removed 123) transitions.
// Phase 1: matrix 68 rows 83 cols
[2024-05-28 19:54:40] [INFO ] Computed 28 invariants in 0 ms
[2024-05-28 19:54:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 19:54:41] [INFO ] Invariant cache hit.
[2024-05-28 19:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:54:41] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-28 19:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-28 19:54:41] [INFO ] Invariant cache hit.
[2024-05-28 19:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 19:54:41] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:54:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 68/151 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 19:54:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/151 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 115 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 4/83 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 68/151 variables, 83/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 64/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 179 constraints, problems are : Problem set: 0 solved, 64 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 3/3 constraints]
After SMT, in 2315ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2316ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/206 places, 68/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2442 ms. Remains : 83/206 places, 68/191 transitions.
[2024-05-28 19:54:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:54:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:54:43] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-28 19:54:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:54:43] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:54:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13394497552398369161.gal : 0 ms
[2024-05-28 19:54:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17511360839345454988.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/CTLFireability13394497552398369161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17511360839345454988.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.37867e+11,0.234259,14236,2,562,5,40984,6,0,397,73088,0


Converting to forward existential form...Done !
original formula: EG((((AG((p69==1)) + (p150==1)) + (AG((p210==0)) + (AF((p35==0)) * !(A(((p34==1)&&(p93==1)) U (p201==1)))))) + ((p41==0) * ((p104==0) + E...171
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !((p69==1)))) + (p150==1)) + (!(E(TRUE U !((p210==0)))) + (!(EG(!((p35==0)))) * !(!((E(...291
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t5, t6, t8, t22, t24, t26, t28, t30, t32, t33, t36, t37, t40, t42, t44, t47, t55,...269
Detected timeout of ITS tools.
[2024-05-28 19:55:13] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:55:13] [INFO ] Applying decomposition
[2024-05-28 19:55:13] [INFO ] Flatten gal took : 2 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/graph2137421106977483306.txt' '-o' '/tmp/graph2137421106977483306.bin' '-w' '/tmp/graph2137421106977483306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2137421106977483306.bin' '-l' '-1' '-v' '-w' '/tmp/graph2137421106977483306.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:55:13] [INFO ] Decomposing Gal with order
[2024-05-28 19:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:55:13] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-28 19:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13552409757777537742.gal : 1 ms
[2024-05-28 19:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11555771337052602746.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/CTLFireability13552409757777537742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11555771337052602746.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.37867e+11,0.073846,7024,129,28,7320,265,218,13625,43,1518,0


Converting to forward existential form...Done !
original formula: EG((((AG((i3.u11.p69==1)) + (i10.i0.u24.p150==1)) + (AG((u30.p210==0)) + (AF((i2.u7.p35==0)) * !(A(((i2.u7.p34==1)&&(i4.u14.p93==1)) U (i...240
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !((i3.u11.p69==1)))) + (i10.i0.u24.p150==1)) + (!(E(TRUE U !((u30.p210==0)))) + (!(EG(!...376
Reverse transition relation is NOT exact ! Due to transitions t55, t61, t67, u30.t32, i0.u2.t0, i0.u8.t24, i1.u9.t36, i2.t22, i2.u6.t33, i3.u10.t37, i4.u14...404
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 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
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 3 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
// Phase 1: matrix 166 rows 181 cols
[2024-05-28 19:55:43] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:55:43] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 19:55:43] [INFO ] Invariant cache hit.
[2024-05-28 19:55:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-28 19:55:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/232 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:55:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/347 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 236 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10036 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:55:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/238 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 165/403 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 13/416 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:56:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:56:01] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/347 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:56:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 424 constraints, problems are : Problem set: 0 solved, 165 unsolved in 19934 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 50/50 constraints]
After SMT, in 29987ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 29988ms
Starting structural reductions in LTL mode, iteration 1 : 181/206 places, 166/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30175 ms. Remains : 181/206 places, 166/191 transitions.
[2024-05-28 19:56:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:56:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:56:13] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-28 19:56:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:56:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5810590280095181206.gal : 0 ms
[2024-05-28 19:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9313381799076931992.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/CTLFireability5810590280095181206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9313381799076931992.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,2.68468e+17,2.82606,102256,2,2593,5,301617,6,0,892,699865,0


Converting to forward existential form...Done !
original formula: AF(EX((p178==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((p178==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t38, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60, t64,...405
Detected timeout of ITS tools.
[2024-05-28 19:56:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:56:43] [INFO ] Applying decomposition
[2024-05-28 19:56:43] [INFO ] Flatten gal took : 3 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/graph10856772553478956142.txt' '-o' '/tmp/graph10856772553478956142.bin' '-w' '/tmp/graph10856772553478956142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10856772553478956142.bin' '-l' '-1' '-v' '-w' '/tmp/graph10856772553478956142.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:56:43] [INFO ] Decomposing Gal with order
[2024-05-28 19:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:56:43] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 19:56:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:56:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2297215935994550191.gal : 2 ms
[2024-05-28 19:56:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13609124771130699805.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/CTLFireability2297215935994550191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13609124771130699805.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.68468e+17,0.310226,16476,524,29,22704,332,450,68278,47,781,0


Converting to forward existential form...Done !
original formula: AF(EX((i13.u58.p178==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((i13.u58.p178==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t84, t132, i0.t130, i0.i0.u1.t136, i0.i0.u8.t131, i0.i1.t128, i0.i1.u5.t135, i0.i1.u9.t1...692
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 7 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
// Phase 1: matrix 166 rows 181 cols
[2024-05-28 19:57:13] [INFO ] Computed 28 invariants in 0 ms
[2024-05-28 19:57:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 19:57:13] [INFO ] Invariant cache hit.
[2024-05-28 19:57:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-28 19:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:17] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:57:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:21] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:57:21] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 239 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10105 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:24] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:57:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 166/347 variables, 181/242 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 165/407 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:57:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:57:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:57:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:57:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
[2024-05-28 19:57:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:57:28] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 7/414 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:29] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-28 19:57:29] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:57:30] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:57:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:57:30] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:57:31] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:32] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:57:35] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:57:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:41] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/347 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:50] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/347 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:57:53] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 432 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 58/58 constraints]
After SMT, in 40127ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40129ms
Starting structural reductions in LTL mode, iteration 1 : 181/206 places, 166/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40282 ms. Remains : 181/206 places, 166/191 transitions.
[2024-05-28 19:57:54] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:57:54] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:57:54] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-28 19:57:54] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:57:54] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:57:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2161201236655182780.gal : 1 ms
[2024-05-28 19:57:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7452478723532560466.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/CTLFireability2161201236655182780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7452478723532560466.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,2.76791e+17,3.90975,126672,2,3032,5,360620,6,0,892,876340,0


Converting to forward existential form...Done !
original formula: AX(EX(((A(((p41==1)&&(p173==1)) U A(((p91==1)&&(p130==1)) U (p41==1))) + AG((p143==0))) + EF((AX((p69==1)) + (p123==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(((!((E(!(!((E(!((p41==1)) U (!(((p91==1)&&(p130==1))) * !((p41==1)))) + EG(!((p41==1)))))) U (...446
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t31, t34, t35, t38, t39, t40, t41, t42, t44, t45, t50, t55, t59,...415
Detected timeout of ITS tools.
[2024-05-28 19:58:24] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:58:24] [INFO ] Applying decomposition
[2024-05-28 19:58:24] [INFO ] Flatten gal took : 3 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/graph10658627454341976254.txt' '-o' '/tmp/graph10658627454341976254.bin' '-w' '/tmp/graph10658627454341976254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10658627454341976254.bin' '-l' '-1' '-v' '-w' '/tmp/graph10658627454341976254.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:58:24] [INFO ] Decomposing Gal with order
[2024-05-28 19:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:58:24] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 19:58:24] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:58:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12076172623981390623.gal : 2 ms
[2024-05-28 19:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13091076701818090675.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/CTLFireability12076172623981390623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13091076701818090675.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.76791e+17,0.519612,23624,610,29,35496,309,432,105012,48,778,0


Converting to forward existential form...Done !
original formula: AX(EX(((A(((i3.u13.p41==1)&&(i12.u58.p173==1)) U A(((i7.i0.u29.p91==1)&&(i8.u40.p130==1)) U (i3.u13.p41==1))) + AG((i6.i2.u45.p143==0))) ...204
=> equivalent forward existential formula: [(EY(Init) * !(EX(((!((E(!(!((E(!((i3.u13.p41==1)) U (!(((i7.i0.u29.p91==1)&&(i8.u40.p130==1))) * !((i3.u13.p41=...599
Reverse transition relation is NOT exact ! Due to transitions t38, t42, t88, t132, i0.t77, i0.u33.t81, i1.i0.u7.t134, i1.i1.t113, i1.i1.t117, i2.t130, i2.i...729
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 10 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
// Phase 1: matrix 166 rows 181 cols
[2024-05-28 19:58:54] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 19:58:54] [INFO ] Invariant cache hit.
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-28 19:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:58:55] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:56] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:58:57] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:58:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:58] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:59:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:59:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:01] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:59:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 19:59:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 0/347 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 247 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12093 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/248 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 165/413 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:59:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:59:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:13] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:59:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 430 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 56/56 constraints]
After SMT, in 32113ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 32114ms
Starting structural reductions in LTL mode, iteration 1 : 181/206 places, 166/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32274 ms. Remains : 181/206 places, 166/191 transitions.
[2024-05-28 19:59:26] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:59:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:59:26] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-28 19:59:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:59:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12010447772583454277.gal : 1 ms
[2024-05-28 19:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17164975375377838640.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/CTLFireability12010447772583454277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17164975375377838640.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.97281e+17,4.01427,127932,2,3319,5,374048,6,0,892,887064,0


Converting to forward existential form...Done !
original formula: E((EX(!(EG(((p127==1)||(p157==1))))) + AX(EG((p203==1)))) U ((AG(EX(((p196==1)||(p58==1)))) * (p94==1)) + ((A(((EX((p131==1)) * (p18==1))...265
=> equivalent forward existential formula: ([((FwdU(Init,(EX(!(EG(((p127==1)||(p157==1))))) + !(EX(!(EG((p203==1))))))) * (p94==1)) * !(E(TRUE U !(EX(((p19...532
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t13, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t59,...427
Detected timeout of ITS tools.
[2024-05-28 19:59:56] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:59:56] [INFO ] Applying decomposition
[2024-05-28 19:59:56] [INFO ] Flatten gal took : 5 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/graph9385011465030496543.txt' '-o' '/tmp/graph9385011465030496543.bin' '-w' '/tmp/graph9385011465030496543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9385011465030496543.bin' '-l' '-1' '-v' '-w' '/tmp/graph9385011465030496543.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:59:56] [INFO ] Decomposing Gal with order
[2024-05-28 19:59:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:59:56] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 19:59:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16957032510865587739.gal : 3 ms
[2024-05-28 19:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11324115482259533647.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/CTLFireability16957032510865587739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11324115482259533647.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.97281e+17,0.388655,19920,670,30,30059,328,459,84825,52,791,0


Converting to forward existential form...Done !
original formula: E((EX(!(EG(((i9.u42.p127==1)||(i11.i0.u54.p157==1))))) + AX(EG((i14.u69.p203==1)))) U ((AG(EX(((i13.u65.p196==1)||(i4.u21.p58==1)))) * (i...394
=> equivalent forward existential formula: ([((FwdU(Init,(EX(!(EG(((i9.u42.p127==1)||(i11.i0.u54.p157==1))))) + !(EX(!(EG((i14.u69.p203==1))))))) * (i6.i1....741
Reverse transition relation is NOT exact ! Due to transitions t42, t87, t132, i0.t130, i0.i0.u1.t136, i0.i0.u9.t131, i0.i1.t128, i0.i1.u6.t135, i0.i1.u10.t...750
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 178 transition count 163
Applied a total of 56 rules in 4 ms. Remains 178 /206 variables (removed 28) and now considering 163/191 (removed 28) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 20:00:26] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 20:00:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 20:00:26] [INFO ] Invariant cache hit.
[2024-05-28 20:00:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 20:00:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:00:29] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:00:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:00:30] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:32] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:00:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:37] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:00:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:00:41] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:00:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 20:00:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17903 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 26731ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 26733ms
Starting structural reductions in LTL mode, iteration 1 : 178/206 places, 163/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26907 ms. Remains : 178/206 places, 163/191 transitions.
[2024-05-28 20:00:53] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:00:53] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-28 20:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:00:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15862256793795072061.gal : 0 ms
[2024-05-28 20:00:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9849343234012318428.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/CTLFireability15862256793795072061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9849343234012318428.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.29062e+17,2.87545,100284,2,2450,5,292868,6,0,877,675011,0


Converting to forward existential form...Done !
original formula: A(AX(AF(AG(((p47==1)||((p89==1)&&(p108==1)))))) U (p46==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p46==1))))) * !(E(!((p46==1)) U (!(!(EX(!(!(EG(!(!(E(TRUE U !(((p47==1)||((p89==1)&&(p108==1))...194
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...405
Detected timeout of ITS tools.
[2024-05-28 20:01:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:01:23] [INFO ] Applying decomposition
[2024-05-28 20:01:23] [INFO ] Flatten gal took : 4 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/graph12703803226889472531.txt' '-o' '/tmp/graph12703803226889472531.bin' '-w' '/tmp/graph12703803226889472531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12703803226889472531.bin' '-l' '-1' '-v' '-w' '/tmp/graph12703803226889472531.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:01:23] [INFO ] Decomposing Gal with order
[2024-05-28 20:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:01:23] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-28 20:01:23] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:01:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:01:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7632671086488908833.gal : 2 ms
[2024-05-28 20:01:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6340084497866974751.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/CTLFireability7632671086488908833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6340084497866974751.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.29062e+17,0.38058,18000,470,29,30208,335,416,56517,45,827,0


Converting to forward existential form...Done !
original formula: A(AX(AF(AG(((i1.i1.u15.p47==1)||((i7.i0.u29.p89==1)&&(i8.u34.p108==1)))))) U (i1.i1.u14.p46==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i1.i1.u14.p46==1))))) * !(E(!((i1.i1.u14.p46==1)) U (!(!(EX(!(!(EG(!(!(E(TRUE U !(((i1.i1.u15....251
Reverse transition relation is NOT exact ! Due to transitions t41, t85, t127, i0.i0.u1.t133, i0.i0.u8.t128, i1.i1.t110, i1.i1.t114, i2.t129, i2.i0.u6.t131,...677
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Applied a total of 46 rules in 5 ms. Remains 183 /206 variables (removed 23) and now considering 168/191 (removed 23) transitions.
// Phase 1: matrix 168 rows 183 cols
[2024-05-28 20:01:53] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 20:01:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 20:01:53] [INFO ] Invariant cache hit.
[2024-05-28 20:01:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-28 20:01:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/351 variables, 183/240 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:01:58] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:01:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:02:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:02:01] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:02:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 250 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12202 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/351 variables, 183/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 167/417 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:02:08] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-28 20:02:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:02:08] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:02:09] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:10] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:02:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:02:10] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:02:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:02:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:02:11] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:02:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/351 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:02:20] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:02:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:02:21] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:02:21] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (OVERLAPS) 0/351 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 438 constraints, problems are : Problem set: 0 solved, 167 unsolved in 22273 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 60/60 constraints]
After SMT, in 34486ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 34488ms
Starting structural reductions in LTL mode, iteration 1 : 183/206 places, 168/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34647 ms. Remains : 183/206 places, 168/191 transitions.
[2024-05-28 20:02:28] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:02:28] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:02:28] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-28 20:02:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:02:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:02:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3355450613935600672.gal : 1 ms
[2024-05-28 20:02:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12300073403796895834.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/CTLFireability3355450613935600672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12300073403796895834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.75255e+17,5.21598,157936,2,3319,5,430613,6,0,902,1.13676e+06,0


Converting to forward existential form...Done !
original formula: EX(((p58==1) + (AF(((p89==1)&&(p108==1))) * ((A(((p172==1)&&(p184==1)) U AX((p124==1))) + EF((p36==1))) + (AX(EF((p151==1))) + (EG((p101=...177
=> equivalent forward existential formula: ([(EY(Init) * (p58==1))] != FALSE + (([(((EY(Init) * !(EG(!(((p89==1)&&(p108==1)))))) * !(EG(!(!(EX(!((p124==1))...525
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t11, t16, t20, t25, t29, t33, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...427
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 20:02:58] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:02:58] [INFO ] Applying decomposition
[2024-05-28 20:02:58] [INFO ] Flatten gal took : 5 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/graph10247690815858320945.txt' '-o' '/tmp/graph10247690815858320945.bin' '-w' '/tmp/graph10247690815858320945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10247690815858320945.bin' '-l' '-1' '-v' '-w' '/tmp/graph10247690815858320945.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:02:58] [INFO ] Decomposing Gal with order
[2024-05-28 20:02:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:02:58] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-28 20:02:58] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:02:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:02:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3247985446147902646.gal : 2 ms
[2024-05-28 20:02:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15958622422793801343.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/CTLFireability3247985446147902646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15958622422793801343.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,3.75255e+17,0.409409,19400,633,29,31641,303,452,66938,47,730,0


Converting to forward existential form...Done !
original formula: EX(((i0.u17.p58==1) + (AF(((i5.i0.u29.p89==1)&&(i7.u36.p108==1))) * ((A(((i12.u60.p172==1)&&(i11.i1.u63.p184==1)) U AX((i9.i1.u43.p124==1...260
=> equivalent forward existential formula: ([(EY(Init) * (i0.u17.p58==1))] != FALSE + (([(((EY(Init) * !(EG(!(((i5.i0.u29.p89==1)&&(i7.u36.p108==1)))))) * ...679
Reverse transition relation is NOT exact ! Due to transitions t44, t86, t132, t134, i0.t106, i0.u17.t110, i1.i1.t130, i1.i1.u5.t137, i1.i1.u9.t131, i1.i2.t...731
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 205 transition count 151
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 166 transition count 149
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 85 place count 165 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 161 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 89 place count 161 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 117 place count 147 transition count 131
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 132 place count 132 transition count 116
Iterating global reduction 4 with 15 rules applied. Total rules applied 147 place count 132 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 147 place count 132 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 165 place count 123 transition count 107
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 251 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 78 transition count 62
Applied a total of 254 rules in 41 ms. Remains 78 /206 variables (removed 128) and now considering 62/191 (removed 129) transitions.
// Phase 1: matrix 62 rows 78 cols
[2024-05-28 20:03:28] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:03:28] [INFO ] Implicit Places using invariants in 48 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 77/206 places, 62/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 94 ms. Remains : 77/206 places, 62/191 transitions.
[2024-05-28 20:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:03:28] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 20:03:28] [INFO ] Flatten gal took : 1 ms
[2024-05-28 20:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:03:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16519460174448349212.gal : 1 ms
[2024-05-28 20:03:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15682298783478696041.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/CTLFireability16519460174448349212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15682298783478696041.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,8.06379e+10,0.063164,6276,2,359,5,12292,6,0,370,16489,0


Converting to forward existential form...Done !
original formula: E(EF(((!(E((p176==1) U (p190==1))) * AG(((p159==1)&&(p161==1)))) * ((p62==1) * ((p190==1) + AF((p36==1)))))) U !(AG(!((AG(((p27==1)&&(p12...193
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,E(TRUE U ((!(E((p176==1) U (p190==1))) * !(E(TRUE U !(((p159==1)&&(p161==1)))))) * ((p62=...277
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t15, t17, t23, t25, t27, t29, t31, t33, t34, t39, t41, t48, t60, Int...249
(forward)formula 0,0,0.130119,8124,1,0,151,28882,153,63,2247,20165,136
FORMULA ShieldIIPt-PT-003B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 190 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 190 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 189 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 188 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 188 transition count 173
Applied a total of 36 rules in 11 ms. Remains 188 /206 variables (removed 18) and now considering 173/191 (removed 18) transitions.
// Phase 1: matrix 173 rows 188 cols
[2024-05-28 20:03:28] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 20:03:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 20:03:29] [INFO ] Invariant cache hit.
[2024-05-28 20:03:29] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-28 20:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:03:31] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:03:32] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:03:32] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 17/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:03:33] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/361 variables, 188/261 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:03:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:38] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:03:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/361 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/361 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (OVERLAPS) 0/361 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 267 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14489 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 51/79 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/361 variables, 188/270 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 172/442 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 5/447 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:52] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:56] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/361 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (OVERLAPS) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 453 constraints, problems are : Problem set: 0 solved, 172 unsolved in 26054 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 65/65 constraints]
After SMT, in 40557ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 40559ms
Starting structural reductions in LTL mode, iteration 1 : 188/206 places, 173/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40721 ms. Remains : 188/206 places, 173/191 transitions.
[2024-05-28 20:04:09] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:04:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:04:09] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-28 20:04:09] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:04:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:04:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6217544338461239734.gal : 1 ms
[2024-05-28 20:04:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16571206981223462197.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/CTLFireability6217544338461239734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16571206981223462197.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.39531e+17,9.35199,275064,2,4884,5,746693,6,0,927,1.99918e+06,0


Converting to forward existential form...Done !
original formula: E((!(((AX(((p196==1)&&(p60==1))) * AG(((p110==1)&&(p116==1)))) * ((A((p35==1) U (p111==1)) + (p190==1)) + (!(((p175==1)&&(p19==1))) * AX(...533
=> equivalent forward existential formula: [((FwdU(Init,(!(((!(EX(!(((p196==1)&&(p60==1))))) * !(E(TRUE U !(((p110==1)&&(p116==1)))))) * ((!((E(!((p111==1)...935
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t11, t13, t16, t17, t21, t23, t24, t27, t33, t37, t38, t41, t42, t43, t44, t45, t47, ...486
Detected timeout of ITS tools.
[2024-05-28 20:04:39] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:04:39] [INFO ] Applying decomposition
[2024-05-28 20:04:39] [INFO ] Flatten gal took : 4 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/graph2643786938660280231.txt' '-o' '/tmp/graph2643786938660280231.bin' '-w' '/tmp/graph2643786938660280231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2643786938660280231.bin' '-l' '-1' '-v' '-w' '/tmp/graph2643786938660280231.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:04:39] [INFO ] Decomposing Gal with order
[2024-05-28 20:04:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:04:39] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-28 20:04:39] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:04:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12506695779493956975.gal : 2 ms
[2024-05-28 20:04:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15519133590664473086.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/CTLFireability12506695779493956975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15519133590664473086.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,6.39531e+17,0.679887,29204,980,29,45578,270,457,125532,49,714,0


Converting to forward existential form...Done !
original formula: E((!(((AX(((i13.u65.p196==1)&&(i1.u22.p60==1))) * AG(((i8.u35.p110==1)&&(i7.i1.u40.p116==1)))) * ((A((i4.u11.p35==1) U (i7.i1.u41.p111==1...825
=> equivalent forward existential formula: [((FwdU(Init,(!(((!(EX(!(((i13.u65.p196==1)&&(i1.u22.p60==1))))) * !(E(TRUE U !(((i8.u35.p110==1)&&(i7.i1.u40.p1...1389
Reverse transition relation is NOT exact ! Due to transitions t45, t91, t139, i0.i0.u1.t143, i1.t107, i1.u21.t112, i1.u22.t108, i1.u22.t114, i2.t135, i2.i1...891
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Applied a total of 46 rules in 3 ms. Remains 183 /206 variables (removed 23) and now considering 168/191 (removed 23) transitions.
// Phase 1: matrix 168 rows 183 cols
[2024-05-28 20:05:09] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 20:05:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 20:05:09] [INFO ] Invariant cache hit.
[2024-05-28 20:05:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-28 20:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:05:11] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:05:12] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/351 variables, 183/233 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:15] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:05:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:05:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/351 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:16] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:05:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:17] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 239 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10084 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/351 variables, 183/240 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 167/407 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:22] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:05:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-28 20:05:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:05:22] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 20:05:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:05:23] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:05:23] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:05:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:05:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:05:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:05:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:05:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:05:27] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:29] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-28 20:05:33] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:05:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/351 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (OVERLAPS) 0/351 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 430 constraints, problems are : Problem set: 0 solved, 167 unsolved in 20904 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 52/52 constraints]
After SMT, in 31000ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 31002ms
Starting structural reductions in LTL mode, iteration 1 : 183/206 places, 168/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31150 ms. Remains : 183/206 places, 168/191 transitions.
[2024-05-28 20:05:41] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:05:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:05:41] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-28 20:05:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:05:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3872021527161710196.gal : 1 ms
[2024-05-28 20:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3071444241260541992.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/CTLFireability3872021527161710196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3071444241260541992.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,2.7247e+17,3.03243,104464,2,2625,5,304416,6,0,902,714075,0


Converting to forward existential form...Done !
original formula: EG(((AG(((p145==0)||((p180==0)&&(((p95==0)||(p108==0))||(p142==0))))) + !(E(AF((p178==1)) U A((p104==1) U (p178==1))))) + (EG((AX((p40==0...188
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((p145==0)||((p180==0)&&(((p95==0)||(p108==0))||(p142==0))))))) + !(E(!(EG(!((p178==1)...314
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t38, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60, t64,...405
Detected timeout of ITS tools.
[2024-05-28 20:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:06:11] [INFO ] Applying decomposition
[2024-05-28 20:06:11] [INFO ] Flatten gal took : 5 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/graph3125538491440222069.txt' '-o' '/tmp/graph3125538491440222069.bin' '-w' '/tmp/graph3125538491440222069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3125538491440222069.bin' '-l' '-1' '-v' '-w' '/tmp/graph3125538491440222069.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:06:11] [INFO ] Decomposing Gal with order
[2024-05-28 20:06:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:06:11] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-28 20:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:06:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:06:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9673106285473942241.gal : 2 ms
[2024-05-28 20:06:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3939018572114842871.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/CTLFireability9673106285473942241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3939018572114842871.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.7247e+17,0.302614,15972,556,38,23108,392,477,55815,62,849,0


Converting to forward existential form...Done !
original formula: EG(((AG(((i0.i1.u47.p145==0)||((i12.i1.u62.p180==0)&&(((i7.i1.u32.p95==0)||(i8.u34.p108==0))||(i6.i2.u44.p142==0))))) + !(E(AF((i11.u58.p...286
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((i0.i1.u47.p145==0)||((i12.i1.u62.p180==0)&&(((i7.i1.u32.p95==0)||(i8.u34.p108==0))||...428
Reverse transition relation is NOT exact ! Due to transitions t44, t84, t130, i0.i0.u1.t138, i1.i0.u10.t131, i1.i1.t110, i1.i1.u22.t105, i2.t118, i2.t114, ...713
Detected timeout of ITS tools.
[2024-05-28 20:06:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:06:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:06:41] [INFO ] Applying decomposition
[2024-05-28 20:06:41] [INFO ] Flatten gal took : 4 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/graph15118532204732033693.txt' '-o' '/tmp/graph15118532204732033693.bin' '-w' '/tmp/graph15118532204732033693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15118532204732033693.bin' '-l' '-1' '-v' '-w' '/tmp/graph15118532204732033693.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:06:41] [INFO ] Decomposing Gal with order
[2024-05-28 20:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:06:41] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-28 20:06:41] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:06:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:06:41] [INFO ] Time to serialize gal into /tmp/CTLFireability265746514387582785.gal : 2 ms
[2024-05-28 20:06:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7698306866033180410.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/CTLFireability265746514387582785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7698306866033180410.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 14 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.46171e+18,0.95869,35952,1378,36,55330,256,494,155950,53,688,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(((i11.u67.p201==1)||(i6.i1.u47.p143==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(((i11.u67.p201==1)||(i6.i1.u47.p143==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t48, t104, t153, i0.i0.u10.t154, i0.i1.t122, i0.i1.t129, i0.i1.u20.t127, i0.i1.u22.t123, i0.i...1083
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,60.0915,1179276,1,0,1.6594e+06,444,2603,3.59177e+06,283,1053,1387616
FORMULA ShieldIIPt-PT-003B-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-28 20:34:11] [INFO ] Applying decomposition
[2024-05-28 20:34:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:34:11] [INFO ] Decomposing Gal with order
[2024-05-28 20:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:34:11] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-28 20:34:11] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:34:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5363467452029815966.gal : 4 ms
[2024-05-28 20:34:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1409762155177240497.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/CTLFireability5363467452029815966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1409762155177240497.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 13 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.46171e+18,90.1398,2695420,3638,280,4.72988e+06,708,267,2.23685e+07,111,6771,0


Converting to forward existential form...Done !
original formula: ((AX(AG(EX((i0.i0.i1.i0.i0.u18.p50==1)))) + ((AG(((EG(((i0.i1.i0.u36.p129==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i1.u81.p87==0))) + (i0.i0.i1.i0.i...579
=> equivalent forward existential formula: ([(FwdU((Init * !((!(EX(!(!(E(TRUE U !(EX((i0.i0.i1.i0.i0.u18.p50==1)))))))) + ((!(E(TRUE U !(((EG(((i0.i1.i0.u3...1351
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t161, i0.i0.i1.u20.t111, i0.i0.i1.u20.t112, i0.i0.i1.u20.t116, i0.i0.i1.u20.t118, i0...1826
ITS-tools command line returned an error code 137
[2024-05-28 20:44:02] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:44:02] [INFO ] Input system was already deterministic with 191 transitions.
[2024-05-28 20:44:02] [INFO ] Transformed 206 places.
[2024-05-28 20:44:02] [INFO ] Transformed 191 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 20:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3594606994164854173.gal : 2 ms
[2024-05-28 20:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12510921919394619210.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/CTLFireability3594606994164854173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12510921919394619210.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 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.46171e+18,5.46494,155872,2,11805,5,534212,6,0,1017,916517,0


Converting to forward existential form...Done !

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="ShieldIIPt-PT-003B"
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 ShieldIIPt-PT-003B, 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 r356-tall-171683760600218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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