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-171683761800754.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 ShieldRVs-PT-004A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 17:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 17:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 25K 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 ShieldRVs-PT-004A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717033805078

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-004A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:50:06] [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-30 01:50:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:50:06] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-30 01:50:06] [INFO ] Transformed 59 places.
[2024-05-30 01:50:06] [INFO ] Transformed 79 transitions.
[2024-05-30 01:50:06] [INFO ] Found NUPN structural information;
[2024-05-30 01:50:06] [INFO ] Parsed PT model containing 59 places and 79 transitions and 368 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 56 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 01:50:06] [INFO ] Computed 17 invariants in 6 ms
[2024-05-30 01:50:06] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-30 01:50:06] [INFO ] Invariant cache hit.
[2024-05-30 01:50:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:50:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:07] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 11 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 01:50:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-30 01:50:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:10] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:10] [INFO ] Deduced a trap composed of 7 places in 493 ms of which 29 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 5 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:50:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5985 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 5 ms to minimize.
[2024-05-30 01:50:15] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:16] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:50:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:17] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5996 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 12076ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 12088ms
Finished structural reductions in LTL mode , in 1 iterations and 12415 ms. Remains : 59/59 places, 79/79 transitions.
Support contains 56 out of 59 places after structural reductions.
[2024-05-30 01:50:19] [INFO ] Flatten gal took : 54 ms
[2024-05-30 01:50:19] [INFO ] Flatten gal took : 39 ms
[2024-05-30 01:50:19] [INFO ] Input system was already deterministic with 79 transitions.
Reduction of identical properties reduced properties to check from 81 to 69
RANDOM walk for 40000 steps (604 resets) in 1432 ms. (27 steps per ms) remains 2/69 properties
BEST_FIRST walk for 40002 steps (130 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (136 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2024-05-30 01:50:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 59/138 variables, and 25 constraints, problems are : Problem set: 2 solved, 0 unsolved in 38 ms.
Refiners :[Domain max(s): 8/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-30 01:50:20] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:50:20] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:50:20] [INFO ] Input system was already deterministic with 79 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 59/59 places, 79/79 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 58 transition count 78
Applied a total of 2 rules in 22 ms. Remains 58 /59 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 58 cols
[2024-05-30 01:50:20] [INFO ] Computed 17 invariants in 4 ms
[2024-05-30 01:50:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 01:50:20] [INFO ] Invariant cache hit.
[2024-05-30 01:50:20] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-30 01:50:20] [INFO ] Redundant transitions in 30 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-30 01:50:20] [INFO ] Computed 17 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 3 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 9 ms to minimize.
[2024-05-30 01:50:21] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:50:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 77/135 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:50:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:24] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4491 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/135 variables, 58/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 76/253 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:50:25] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 254 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2470 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 45/45 constraints]
After SMT, in 7055ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/59 places, 77/79 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7357 ms. Remains : 58/59 places, 77/79 transitions.
[2024-05-30 01:50:27] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:27] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:27] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-30 01:50:27] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:50:27] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3967455104427656693.gal : 12 ms
[2024-05-30 01:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15908811785213407491.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/CTLFireability3967455104427656693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15908811785213407491.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.199897,11424,2,1618,5,24746,6,0,311,54052,0


Converting to forward existential form...Done !
original formula: EF((EF(EG(!(E((((p3==1)&&(p18==1))&&(p30==1)) U (((p34==1)&&(p35==1))&&(p39==1)))))) * (((p3==0)||(p20==0))||((p30==0)||(p39==0)))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * (((p3==0)||(p20==0))||((p30==0)||(p39==0)))),TRUE),!(E((((p3==1)&&(p18==1))&&(p30=...207
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...445
(forward)formula 0,1,5.21217,187028,1,0,353,767980,182,116,2699,1.45977e+06,296
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 01:50:33] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 01:50:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 01:50:33] [INFO ] Invariant cache hit.
[2024-05-30 01:50:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:50:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:33] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:34] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:50:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3216 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:50:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:38] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:50:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:50:39] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4604 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7872ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7873ms
Finished structural reductions in LTL mode , in 1 iterations and 8013 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:50:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:41] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:50:41] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:50:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:50:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12786678197060171811.gal : 2 ms
[2024-05-30 01:50:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2474582503930698712.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/CTLFireability12786678197060171811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2474582503930698712.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.198135,11500,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: E((EF(AX((p15==1))) + AG((EG(AG((p14==1))) + ((AX((((p20==1)&&(p21==1))&&(p25==1))) * A((p10==1) U (((p3==1)&&(p18==1))&&(p30==1)))) * !(...215
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U !(EX(!((p15==1))))) + !(E(TRUE U !((EG(!(E(TRUE U !((p14==1))))) + ((!(EX(!((((p20==1)&&(p...394
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:51:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:51:11] [INFO ] Applying decomposition
[2024-05-30 01:51: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/graph9094840999293315146.txt' '-o' '/tmp/graph9094840999293315146.bin' '-w' '/tmp/graph9094840999293315146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9094840999293315146.bin' '-l' '-1' '-v' '-w' '/tmp/graph9094840999293315146.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:51:11] [INFO ] Decomposing Gal with order
[2024-05-30 01:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:51:11] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:51:11] [INFO ] Flatten gal took : 99 ms
[2024-05-30 01:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 12 ms.
[2024-05-30 01:51:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12856435450264103446.gal : 15 ms
[2024-05-30 01:51:11] [INFO ] Time to serialize properties into /tmp/CTLFireability18222632062003752212.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/CTLFireability12856435450264103446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18222632062003752212.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.566897,25648,518,29,35963,382,112,145553,31,2333,0


Converting to forward existential form...Done !
original formula: E((EF(AX((i0.u4.p15==1))) + AG((EG(AG((i0.u4.p14==1))) + ((AX((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p25==1))) * A((i0.u3.p10==1) U ((...299
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U !(EX(!((i0.u4.p15==1))))) + !(E(TRUE U !((EG(!(E(TRUE U !((i0.u4.p14==1))))) + ((!(EX(!(((...514
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 01:51:41] [INFO ] Invariant cache hit.
[2024-05-30 01:51:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 01:51:41] [INFO ] Invariant cache hit.
[2024-05-30 01:51:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:51:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:51:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:51:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:51:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:51:44] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3226 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:51:45] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:47] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:51:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:51:47] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4611 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7875ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7878ms
Finished structural reductions in LTL mode , in 1 iterations and 8022 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:51:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:51:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:51:49] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:51:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:51:49] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:51:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1409168916754805189.gal : 5 ms
[2024-05-30 01:51:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9028733602937607998.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/CTLFireability1409168916754805189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9028733602937607998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.199827,11520,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: (E(!((!(AX((((p3==1)&&(p20==1))&&(p30==1)))) * EF(!((((p38==1)&&(p3==1))&&((p20==1)&&(p30==1))))))) U EG(!(A((((p2==1)&&(p6==1))&&(p16==1...328
=> equivalent forward existential formula: [(FwdU((((FwdU((Init * !(E(!((!(!(EX(!((((p3==1)&&(p20==1))&&(p30==1)))))) * E(TRUE U !((((p38==1)&&(p3==1))&&((...446
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:52:19] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:52:19] [INFO ] Applying decomposition
[2024-05-30 01:52:19] [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/graph8686488079964461845.txt' '-o' '/tmp/graph8686488079964461845.bin' '-w' '/tmp/graph8686488079964461845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8686488079964461845.bin' '-l' '-1' '-v' '-w' '/tmp/graph8686488079964461845.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:52:19] [INFO ] Decomposing Gal with order
[2024-05-30 01:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:52:19] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:52:19] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 3 ms.
[2024-05-30 01:52:19] [INFO ] Time to serialize gal into /tmp/CTLFireability15172156994110434842.gal : 1 ms
[2024-05-30 01:52:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18271139581836249231.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/CTLFireability15172156994110434842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18271139581836249231.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.648731,26992,518,29,36996,395,112,157759,31,2448,0


Converting to forward existential form...Done !
original formula: (E(!((!(AX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1)))) * EF(!((((i2.u11.p38==1)&&(i0.u1.p3==1))&&((i1.u5.p20==1)&&(i1.u8.p30==1))...469
=> equivalent forward existential formula: [(FwdU((((FwdU((Init * !(E(!((!(!(EX(!((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1)))))) * E(TRUE U !((((i2....601
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 01:52:49] [INFO ] Invariant cache hit.
[2024-05-30 01:52:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 01:52:49] [INFO ] Invariant cache hit.
[2024-05-30 01:52:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:52:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:52:51] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 12 places in 14 ms of which 1 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 4 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:52:52] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3303 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:53] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:52:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4695 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 8043ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8045ms
Finished structural reductions in LTL mode , in 1 iterations and 8167 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:52:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:52:58] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18142891150965411102.gal : 1 ms
[2024-05-30 01:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8648626859010138053.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/CTLFireability18142891150965411102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8648626859010138053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.24902,11520,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: (EF(AX(AG((p14==0)))) * (EX(((EG((((p2==0)||(p6==0))||(p15==0))) + EG(((((p31==1)&&(p48==1))&&(p57==1))||(((p48==1)&&(p49==1))&&(p53==1))...208
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(!(E(TRUE U !((p14==0))))))))))] = FALSE * [FwdG((Init * !(EX(((EG((((p2==0)||(p6==0)...314
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:53:28] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:53:28] [INFO ] Applying decomposition
[2024-05-30 01:53:28] [INFO ] Flatten gal took : 17 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/graph12837940928870452509.txt' '-o' '/tmp/graph12837940928870452509.bin' '-w' '/tmp/graph12837940928870452509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12837940928870452509.bin' '-l' '-1' '-v' '-w' '/tmp/graph12837940928870452509.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:53:28] [INFO ] Decomposing Gal with order
[2024-05-30 01:53:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:53:28] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:53:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-30 01:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11540961263628912635.gal : 28 ms
[2024-05-30 01:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7807560327176278274.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/CTLFireability11540961263628912635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7807560327176278274.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.672069,24084,424,29,32369,393,105,136078,31,2422,0


Converting to forward existential form...Done !
original formula: (EF(AX(AG((i0.u4.p14==0)))) * (EX(((EG((((i0.u0.p2==0)||(i0.u1.p6==0))||(i0.u4.p15==0))) + EG(((((i2.u9.p31==1)&&(i3.u13.p48==1))&&(i3.u1...293
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(!(E(TRUE U !((i0.u4.p14==0))))))))))] = FALSE * [FwdG((Init * !(EX(((EG((((i0.u0.p2=...399
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 : 59/59 places, 79/79 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 58 transition count 78
Applied a total of 2 rules in 24 ms. Remains 58 /59 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 58 cols
[2024-05-30 01:53:58] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 01:53:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:53:58] [INFO ] Invariant cache hit.
[2024-05-30 01:53:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-30 01:53:58] [INFO ] Redundant transitions in 22 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-30 01:53:58] [INFO ] Computed 17 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:53:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 77/135 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:00] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 2 ms to minimize.
[2024-05-30 01:54:01] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:54:02] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4205 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/135 variables, 58/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 76/253 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:54:03] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 254 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2480 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 45/45 constraints]
After SMT, in 6744ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6746ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/59 places, 77/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6932 ms. Remains : 58/59 places, 77/79 transitions.
[2024-05-30 01:54:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:54:05] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:54:05] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-30 01:54:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:54:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4421970757151184053.gal : 1 ms
[2024-05-30 01:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability107930360345014273.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/CTLFireability4421970757151184053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability107930360345014273.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.222875,11512,2,1618,5,24746,6,0,311,54052,0


Converting to forward existential form...Done !
original formula: A((((p54==1)&&(p56==1))&&(p0!=1)) U AG(EF(!(((AF((((p20==1)&&(p21==1))&&(p26==1))) * (p19==1)) * ((p21==1)&&(p25==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(((!(EG(!((((p20==1)&&(p21==1))&&(p26==1))))) * (p19==1)) * ((p21==1)&&(...459
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...445
Detected timeout of ITS tools.
[2024-05-30 01:54:35] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:54:35] [INFO ] Applying decomposition
[2024-05-30 01:54:35] [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/graph9273322735025006118.txt' '-o' '/tmp/graph9273322735025006118.bin' '-w' '/tmp/graph9273322735025006118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9273322735025006118.bin' '-l' '-1' '-v' '-w' '/tmp/graph9273322735025006118.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:54:35] [INFO ] Decomposing Gal with order
[2024-05-30 01:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:54:35] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-30 01:54:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 2 ms.
[2024-05-30 01:54:35] [INFO ] Time to serialize gal into /tmp/CTLFireability442601411007876562.gal : 1 ms
[2024-05-30 01:54:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12482189720498750457.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/CTLFireability442601411007876562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12482189720498750457.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.494176,22764,562,29,31888,339,125,124359,33,2002,0


Converting to forward existential form...Done !
original formula: A((((i3.u15.p54==1)&&(i3.u16.p56==1))&&(i1.u6.p0!=1)) U AG(EF(!(((AF((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p26==1))) * (i1.u5.p19==1)...196
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(((!(EG(!((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p26==1))))) * (i1.u5...587
Reverse transition relation is NOT exact ! Due to transitions t28, t31, t41, t43, t52, t73, i0.t66, i0.t37, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...509
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 01:55:05] [INFO ] Computed 17 invariants in 3 ms
[2024-05-30 01:55:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 01:55:05] [INFO ] Invariant cache hit.
[2024-05-30 01:55:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 5 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 5 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:55:06] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:55:07] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:55:08] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:55:08] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3176 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:55:09] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:10] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:55:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:55:11] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4547 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7775ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7777ms
Finished structural reductions in LTL mode , in 1 iterations and 7904 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:55:13] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:55:13] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:55:13] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6994035940224586685.gal : 1 ms
[2024-05-30 01:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16852649454865055740.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/CTLFireability6994035940224586685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16852649454865055740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.194662,11528,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: ((EG((((AF(EX((((p38==0)||(p42==0))||(p51==0)))) * !(A((((p17==1)&&(p34==1))&&(p44==1)) U (((p10==1)&&(p16==1))&&(p23==1))))) * EG((p39==...449
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !((EG((((!(EG(!(EX((((p38==0)||(p42==0))||(p51==0)))))) * !(!((E(!((((p10==1)&&(p16==1))&&(p...820
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:55:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:55:43] [INFO ] Applying decomposition
[2024-05-30 01:55:43] [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/graph15171530802305904758.txt' '-o' '/tmp/graph15171530802305904758.bin' '-w' '/tmp/graph15171530802305904758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15171530802305904758.bin' '-l' '-1' '-v' '-w' '/tmp/graph15171530802305904758.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:55:43] [INFO ] Decomposing Gal with order
[2024-05-30 01:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:55:43] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:55:43] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-30 01:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16193205337235255097.gal : 17 ms
[2024-05-30 01:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12485754269658540313.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/CTLFireability16193205337235255097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12485754269658540313.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.609494,26464,532,29,36493,419,112,153331,31,2547,0


Converting to forward existential form...Done !
original formula: ((EG((((AF(EX((((i2.u11.p38==0)||(i2.u12.p42==0))||(i3.u15.p51==0)))) * !(A((((i1.u5.p17==1)&&(i2.u9.p34==1))&&(i2.u12.p44==1)) U (((i0.u...651
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !((EG((((!(EG(!(EX((((i2.u11.p38==0)||(i2.u12.p42==0))||(i3.u15.p51==0)))))) * !(!((E(!((((i...1130
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 01:56:13] [INFO ] Invariant cache hit.
[2024-05-30 01:56:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:56:13] [INFO ] Invariant cache hit.
[2024-05-30 01:56:13] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:56:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:56:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:56:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:56:16] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:16] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:56:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:56:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3179 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:56:17] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:19] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:56:19] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:56:19] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4564 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7775ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7776ms
Finished structural reductions in LTL mode , in 1 iterations and 7907 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:56:21] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:56:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:56:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12116155722638342096.gal : 7 ms
[2024-05-30 01:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17464914808782858894.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/CTLFireability12116155722638342096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17464914808782858894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.194556,11528,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: AX(EG(((EX((((p3==1)&&(p20==1))&&(p30==1))) + (p32==0)) + E(EF((((p2==1)&&(p6==1))&&(p15==1))) U ((p22==1)&&(p27==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((EX((((p3==1)&&(p20==1))&&(p30==1))) + (p32==0)) + E(E(TRUE U (((p2==1)&&(p6==1))&&(p15==1)))...192
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:56:51] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:56:51] [INFO ] Applying decomposition
[2024-05-30 01:56:51] [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/graph16450366685962278136.txt' '-o' '/tmp/graph16450366685962278136.bin' '-w' '/tmp/graph16450366685962278136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16450366685962278136.bin' '-l' '-1' '-v' '-w' '/tmp/graph16450366685962278136.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:56:51] [INFO ] Decomposing Gal with order
[2024-05-30 01:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:56:51] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:56:51] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2024-05-30 01:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14889219691007409062.gal : 1 ms
[2024-05-30 01:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2072659036889940872.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/CTLFireability14889219691007409062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2072659036889940872.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.518987,24088,424,29,32800,414,105,135122,31,2460,0


Converting to forward existential form...Done !
original formula: AX(EG(((EX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1))) + (i2.u9.p32==0)) + E(EF((((i0.u0.p2==1)&&(i0.u1.p6==1))&&(i0.u4.p15==1))) ...193
=> equivalent forward existential formula: [(EY(Init) * !(EG(((EX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1))) + (i2.u9.p32==0)) + E(E(TRUE U (((i0.u...246
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 59/59 places, 79/79 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 58 transition count 78
Applied a total of 2 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 58 cols
[2024-05-30 01:57:21] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 01:57:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:57:21] [INFO ] Invariant cache hit.
[2024-05-30 01:57:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-30 01:57:21] [INFO ] Redundant transitions in 21 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-30 01:57:21] [INFO ] Computed 17 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:57:22] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 77/135 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:57:23] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:57:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:57:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:57:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:57:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:57:25] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4210 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/135 variables, 58/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 76/253 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:57:26] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 254 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2403 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 45/45 constraints]
After SMT, in 6660ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6660ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/59 places, 77/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6817 ms. Remains : 58/59 places, 77/79 transitions.
[2024-05-30 01:57:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:57:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:57:28] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-30 01:57:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:57:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15890410194603468316.gal : 16 ms
[2024-05-30 01:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2872794467994472877.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/CTLFireability15890410194603468316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2872794467994472877.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.203304,11516,2,1618,5,24746,6,0,311,54052,0


Converting to forward existential form...Done !
original formula: AG((AG((AF((((p40==0)||(p44==0))||(p51==0))) + (EG((((p12==1)&&(p14==1))&&(p23==1))) * (p11==0)))) * AF(((p52==1)&&(p56==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),TRUE) * !((EG((((p12==1)&&(p14==1))&&(p23==1))) * (p11==0)))),!((((p40==0)||(p44==0...238
Hit Full ! (commute/partial/dont) 69/0/8
(forward)formula 0,0,3.45809,118768,1,0,77,406973,20,3,1925,884763,76
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 01:57:32] [INFO ] Computed 17 invariants in 7 ms
[2024-05-30 01:57:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 01:57:32] [INFO ] Invariant cache hit.
[2024-05-30 01:57:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:32] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2024-05-30 01:57:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 7 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:57:33] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:57:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:57:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3477 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:35] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:57:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:57:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:57:38] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4574 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 8110ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8111ms
Finished structural reductions in LTL mode , in 1 iterations and 8237 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:57:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:57:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:57:40] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:57:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:57:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3556359071553617556.gal : 2 ms
[2024-05-30 01:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12561387154588956282.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/CTLFireability3556359071553617556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12561387154588956282.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.214453,11524,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((((p20==0)||(p21==0))||(p26==0)))) + (AG(((A((((p5==1)&&(p7==1))&&(p12==1)) U (p5==1)) + AX((((p38==1)&&(p44==1))&&(p51==1)))) ...225
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((((p20==0)||(p21==0))||(p26==0)))))))) + (!(E(TRUE U !(((!((E(!((p5==1)) U (!(((...353
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 01:58:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:58:10] [INFO ] Applying decomposition
[2024-05-30 01:58:10] [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/graph17725517445303650329.txt' '-o' '/tmp/graph17725517445303650329.bin' '-w' '/tmp/graph17725517445303650329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17725517445303650329.bin' '-l' '-1' '-v' '-w' '/tmp/graph17725517445303650329.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:58:10] [INFO ] Decomposing Gal with order
[2024-05-30 01:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:58:10] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:58:10] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-30 01:58:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7472852566192989809.gal : 2 ms
[2024-05-30 01:58:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11656193878099576868.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/CTLFireability7472852566192989809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11656193878099576868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.533227,24088,424,29,32878,397,105,135061,31,2424,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((((i1.u5.p20==0)||(i1.u6.p21==0))||(i1.u7.p26==0)))) + (AG(((A((((i0.u1.p5==1)&&(i0.u2.p7==1))&&(i0.u3.p12==1)) U (i0.u1.p5==1)...318
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((((i1.u5.p20==0)||(i1.u6.p21==0))||(i1.u7.p26==0)))))))) + (!(E(TRUE U !(((!((E(...458
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 01:58:40] [INFO ] Invariant cache hit.
[2024-05-30 01:58:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:58:40] [INFO ] Invariant cache hit.
[2024-05-30 01:58:40] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:58:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:58:41] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:58:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:58:43] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3144 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:58:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:45] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:58:45] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:58:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4631 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7826ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7828ms
Finished structural reductions in LTL mode , in 1 iterations and 7952 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 01:58:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:58:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:58:48] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:58:48] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:58:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2132764305970460196.gal : 13 ms
[2024-05-30 01:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3180655553003538311.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/CTLFireability2132764305970460196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3180655553003538311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.204781,11528,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: !(A((p15==1) U (EX(E(AG((p15==1)) U AF((p0==1)))) + A(((((p6==1)&&(p7==1))&&(p11==1)) + A((((p6==1)&&(p7==1))&&(p11==1)) U (((p48==1)&&(p...310
=> equivalent forward existential formula: ([(((FwdU(Init,!((EX(E(!(E(TRUE U !((p15==1)))) U !(EG(!((p0==1)))))) + !((E(!((((((p47==1)&&(p52==1))&&(p56==1)...2138
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 01:59:18] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:59:18] [INFO ] Applying decomposition
[2024-05-30 01:59:18] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2517229936972562986.txt' '-o' '/tmp/graph2517229936972562986.bin' '-w' '/tmp/graph2517229936972562986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2517229936972562986.bin' '-l' '-1' '-v' '-w' '/tmp/graph2517229936972562986.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:59:18] [INFO ] Decomposing Gal with order
[2024-05-30 01:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:59:18] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 01:59:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 1 ms.
[2024-05-30 01:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1715610439624819276.gal : 2 ms
[2024-05-30 01:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10241273647902604085.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/CTLFireability1715610439624819276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10241273647902604085.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.578859,23820,424,29,31809,399,105,133897,31,2400,0


Converting to forward existential form...Done !
original formula: !(A((i0.u4.p15==1) U (EX(E(AG((i0.u4.p15==1)) U AF((i0.u2.p0==1)))) + A(((((i0.u1.p6==1)&&(i0.u2.p7==1))&&(i0.u3.p11==1)) + A((((i0.u1.p6...458
=> equivalent forward existential formula: ([(((FwdU(Init,!((EX(E(!(E(TRUE U !((i0.u4.p15==1)))) U !(EG(!((i0.u2.p0==1)))))) + !((E(!((((((i3.u13.p47==1)&&...3134
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 : 59/59 places, 79/79 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 58 transition count 78
Applied a total of 2 rules in 5 ms. Remains 58 /59 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 58 cols
[2024-05-30 01:59:48] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 01:59:48] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 01:59:48] [INFO ] Invariant cache hit.
[2024-05-30 01:59:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-30 01:59:48] [INFO ] Redundant transitions in 27 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-30 01:59:48] [INFO ] Computed 17 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:59:49] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 77/135 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:59:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:59:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4068 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/135 variables, 58/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 76/253 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 01:59:53] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 254 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2494 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 45/45 constraints]
After SMT, in 6594ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6597ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/59 places, 77/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6773 ms. Remains : 58/59 places, 77/79 transitions.
[2024-05-30 01:59:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:59:55] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:59:55] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-30 01:59:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:59:55] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:59:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12867247133813261971.gal : 1 ms
[2024-05-30 01:59:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14521062289785504659.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/CTLFireability12867247133813261971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14521062289785504659.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.197869,11512,2,1618,5,24746,6,0,311,54052,0


Converting to forward existential form...Done !
original formula: EF(((EF((EG((((p47==0)||(p49==0))||(p54==0))) * AG((((p24==0)||(p28==0))||(p37==0))))) * A(((p36==1)&&(p41==1)) U EG(!((((p31==1)&&(p46==...236
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (E(TRUE U (EG((((p47==0)||(p49==0))||(p54==0))) * !(E(TRUE U !((((p24==0)||(p28==0))||...414
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...445
Detected timeout of ITS tools.
[2024-05-30 02:00:25] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:00:25] [INFO ] Applying decomposition
[2024-05-30 02:00:25] [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/graph14640424468498040147.txt' '-o' '/tmp/graph14640424468498040147.bin' '-w' '/tmp/graph14640424468498040147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14640424468498040147.bin' '-l' '-1' '-v' '-w' '/tmp/graph14640424468498040147.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:00:25] [INFO ] Decomposing Gal with order
[2024-05-30 02:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:00:25] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-30 02:00:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 2 ms.
[2024-05-30 02:00:25] [INFO ] Time to serialize gal into /tmp/CTLFireability371900772558184418.gal : 2 ms
[2024-05-30 02:00:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11167651349610911408.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/CTLFireability371900772558184418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11167651349610911408.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.496678,21712,468,29,29473,343,119,118352,33,2078,0


Converting to forward existential form...Done !
original formula: EF(((EF((EG((((i3.u13.p47==0)||(i3.u14.p49==0))||(i3.u15.p54==0))) * AG((((i1.u7.p24==0)||(i1.u8.p28==0))||(i2.u11.p37==0))))) * A(((i2.u...343
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (E(TRUE U (EG((((i3.u13.p47==0)||(i3.u14.p49==0))||(i3.u15.p54==0))) * !(E(TRUE U !(((...561
Reverse transition relation is NOT exact ! Due to transitions t28, t31, t41, t43, t52, t73, i0.t66, i0.t37, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...509
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 02:00:55] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 02:00:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:00:55] [INFO ] Invariant cache hit.
[2024-05-30 02:00:55] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 02:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 3 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:00:56] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:00:57] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2758 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:58] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:00:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:00:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:01:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:01:00] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:01:00] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:01:01] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4566 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7350ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7351ms
Finished structural reductions in LTL mode , in 1 iterations and 7465 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 02:01:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:01:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:01:03] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 02:01:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:01:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7493889385141239302.gal : 1 ms
[2024-05-30 02:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17660594735310513443.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/CTLFireability7493889385141239302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17660594735310513443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.193229,11524,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: A(E(AF((((p47==1)&&(p49==1))&&(p53==1))) U (((p3==1)&&(p20==1))&&(p29==1))) U AX((((p48==1)&&(p49==1))&&(p54==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((((p48==1)&&(p49==1))&&(p54==1))))))))) * !(E(!(!(EX(!((((p48==1)&&(p49==1))&&(p54==1)))...306
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 02:01:33] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:33] [INFO ] Applying decomposition
[2024-05-30 02:01:33] [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/graph427981933666677537.txt' '-o' '/tmp/graph427981933666677537.bin' '-w' '/tmp/graph427981933666677537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph427981933666677537.bin' '-l' '-1' '-v' '-w' '/tmp/graph427981933666677537.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:01:33] [INFO ] Decomposing Gal with order
[2024-05-30 02:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:01:33] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:01:33] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:01:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 1 ms.
[2024-05-30 02:01:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5879249746083154698.gal : 16 ms
[2024-05-30 02:01:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6807588814022494889.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/CTLFireability5879249746083154698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6807588814022494889.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.546385,25408,518,29,35361,394,112,145181,31,2294,0


Converting to forward existential form...Done !
original formula: A(E(AF((((i3.u13.p47==1)&&(i3.u14.p49==1))&&(i3.u15.p53==1))) U (((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p29==1))) U AX((((i3.u13.p48==1)...193
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((((i3.u13.p48==1)&&(i3.u14.p49==1))&&(i3.u15.p54==1))))))))) * !(E(!(!(EX(!((((i3.u13.p4...408
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 : 59/59 places, 79/79 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 78
Applied a total of 2 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 58 cols
[2024-05-30 02:02:03] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 02:02:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 02:02:03] [INFO ] Invariant cache hit.
[2024-05-30 02:02:03] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 02:02:03] [INFO ] Redundant transitions in 27 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-30 02:02:03] [INFO ] Computed 17 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:02:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:02:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 9 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:02:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 77/135 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:02:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:02:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:07] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4192 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/135 variables, 58/177 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 76/253 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 02:02:08] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 254 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2497 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 45/45 constraints]
After SMT, in 6720ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6721ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/59 places, 77/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6896 ms. Remains : 58/59 places, 77/79 transitions.
[2024-05-30 02:02:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:02:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:02:10] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-30 02:02:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:02:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:02:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9240276762493470110.gal : 2 ms
[2024-05-30 02:02:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1838300814022383856.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/CTLFireability9240276762493470110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1838300814022383856.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.191669,11512,2,1618,5,24746,6,0,311,54052,0


Converting to forward existential form...Done !
original formula: EF(AG((EF((p4==1)) * (((p6==0)||(p7==0))||(p12==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (p4==1)) * (((p6==0)||(p7==0))||(p12==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...445
Detected timeout of ITS tools.
[2024-05-30 02:02:40] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:02:40] [INFO ] Applying decomposition
[2024-05-30 02:02:40] [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/graph10682625660425033537.txt' '-o' '/tmp/graph10682625660425033537.bin' '-w' '/tmp/graph10682625660425033537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10682625660425033537.bin' '-l' '-1' '-v' '-w' '/tmp/graph10682625660425033537.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:02:40] [INFO ] Decomposing Gal with order
[2024-05-30 02:02:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:02:40] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-30 02:02:40] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:02:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 1 ms.
[2024-05-30 02:02:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17155697484068925244.gal : 1 ms
[2024-05-30 02:02:40] [INFO ] Time to serialize properties into /tmp/CTLFireability737557870025261516.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/CTLFireability17155697484068925244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability737557870025261516.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04819e+08,0.490164,22768,562,29,31987,366,125,124039,33,2005,0


Converting to forward existential form...Done !
original formula: EF(AG((EF((i0.u1.p4==1)) * (((i0.u1.p6==0)||(i0.u2.p7==0))||(i0.u3.p12==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (i0.u1.p4==1)) * (((i0.u1.p6==0)||(i0.u2.p7==0))||(i0.u3.p12==0))))))...166
Reverse transition relation is NOT exact ! Due to transitions t28, t31, t41, t43, t52, t73, i0.t66, i0.t37, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...509
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-05-30 02:03:10] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 02:03:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 02:03:10] [INFO ] Invariant cache hit.
[2024-05-30 02:03:10] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 02:03:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:03:11] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:03:12] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:03:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:03:13] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3185 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:03:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:03:16] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:03:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4614 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7827ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7829ms
Finished structural reductions in LTL mode , in 1 iterations and 7961 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:18] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15246117813575221836.gal : 1 ms
[2024-05-30 02:03:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5591982090639297497.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/CTLFireability15246117813575221836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5591982090639297497.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.206138,11524,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: (E(!(EG(((AF(((p54==1)&&(p58==1))) * ((((p5==1)&&(p7==1))&&(p12==1))||(p5==1))) * (E((p52==1) U (p24==1)) + (((p39==1)&&(p33==1))&&((p35=...462
=> equivalent forward existential formula: ((([((FwdU(Init,!(EG(((!(EG(!(((p54==1)&&(p58==1))))) * ((((p5==1)&&(p7==1))&&(p12==1))||(p5==1))) * (E((p52==1)...1071
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:48] [INFO ] Applying decomposition
[2024-05-30 02:03:48] [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/graph16762730251783575729.txt' '-o' '/tmp/graph16762730251783575729.bin' '-w' '/tmp/graph16762730251783575729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16762730251783575729.bin' '-l' '-1' '-v' '-w' '/tmp/graph16762730251783575729.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:03:48] [INFO ] Decomposing Gal with order
[2024-05-30 02:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:03:48] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 1 ms.
[2024-05-30 02:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9814066574342055357.gal : 3 ms
[2024-05-30 02:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1281674214832494816.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/CTLFireability9814066574342055357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1281674214832494816.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.59205,25148,424,29,33532,390,105,146792,31,2399,0


Converting to forward existential form...Done !
original formula: (E(!(EG(((AF(((i3.u15.p54==1)&&(i3.u16.p58==1))) * ((((i0.u1.p5==1)&&(i0.u2.p7==1))&&(i0.u3.p12==1))||(i0.u1.p5==1))) * (E((i3.u15.p52==1...671
=> equivalent forward existential formula: ((([((FwdU(Init,!(EG(((!(EG(!(((i3.u15.p54==1)&&(i3.u16.p58==1))))) * ((((i0.u1.p5==1)&&(i0.u2.p7==1))&&(i0.u3.p...1492
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 02:04:18] [INFO ] Invariant cache hit.
[2024-05-30 02:04:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 02:04:18] [INFO ] Invariant cache hit.
[2024-05-30 02:04:18] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 02:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:04:19] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:04:20] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:21] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:04:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:04:21] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3164 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:22] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:04:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:04:24] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:04:24] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4520 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7711ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7712ms
Finished structural reductions in LTL mode , in 1 iterations and 7830 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 02:04:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:04:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:04:26] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 02:04:26] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:04:26] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:04:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17272559746484737631.gal : 1 ms
[2024-05-30 02:04:26] [INFO ] Time to serialize properties into /tmp/CTLFireability244004865231806269.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/CTLFireability17272559746484737631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability244004865231806269.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.210171,11528,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: (AG(EF((((p18==1) * !(E((p47==1) U (((p12==1)&&(p16==1))&&(p23==1))))) * E((((p31==1)&&(p46==1))&&(p57==1)) U ((p54==1)&&(p56==1)))))) + ...291
=> equivalent forward existential formula: [(FwdU((Init * !((EG((((p40==0)||(p44==0))||(p51==0))) * !((E(!((((p45==1)&&(p10==1))&&(!(((p31==1)&&(p46==1))&&...501
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 02:04:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:04:56] [INFO ] Applying decomposition
[2024-05-30 02:04:56] [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/graph18060840470373081196.txt' '-o' '/tmp/graph18060840470373081196.bin' '-w' '/tmp/graph18060840470373081196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18060840470373081196.bin' '-l' '-1' '-v' '-w' '/tmp/graph18060840470373081196.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:04:56] [INFO ] Decomposing Gal with order
[2024-05-30 02:04:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:04:56] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:04:56] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:04:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 1 ms.
[2024-05-30 02:04:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9432468802621544347.gal : 1 ms
[2024-05-30 02:04:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8793795740271497943.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/CTLFireability9432468802621544347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8793795740271497943.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.581773,23828,424,29,32210,412,105,134843,31,2429,0


Converting to forward existential form...Done !
original formula: (AG(EF((((i1.u5.p18==1) * !(E((i3.u13.p47==1) U (((i0.u3.p12==1)&&(i0.u4.p16==1))&&(i1.u7.p23==1))))) * E((((i2.u9.p31==1)&&(i3.u13.p46==...423
=> equivalent forward existential formula: [(FwdU((Init * !((EG((((i2.u11.p40==0)||(i2.u12.p44==0))||(i3.u15.p51==0))) * !((E(!((((i3.u13.p45==1)&&(i0.u3.p...699
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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 LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-30 02:05:26] [INFO ] Invariant cache hit.
[2024-05-30 02:05:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 02:05:26] [INFO ] Invariant cache hit.
[2024-05-30 02:05:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 02:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:05:27] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/138 variables, 59/151 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:05:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:05:29] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:05:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:05:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3165 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 79/138 variables, 59/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 78/247 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:30] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:05:31] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:05:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 02:05:32] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/138 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 253 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4439 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 40/40 constraints]
After SMT, in 7632ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7637ms
Finished structural reductions in LTL mode , in 1 iterations and 7752 ms. Remains : 59/59 places, 79/79 transitions.
[2024-05-30 02:05:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:05:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:05:34] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 02:05:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:05:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8578289744214319183.gal : 1 ms
[2024-05-30 02:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7629619515630545216.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/CTLFireability8578289744214319183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7629619515630545216.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.192381,11524,2,1658,5,25215,6,0,317,55142,0


Converting to forward existential form...Done !
original formula: AF(((EX(((AX((((p38==0)||(p44==0))||(p51==0))) * (p15==0)) * (((p34==0)||(p35==0))||(p39==0)))) * A(A(((((p3==1)&&(p20==1))&&(p30==1)) + ...488
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((!(EX(!((((p38==0)||(p44==0))||(p51==0))))) * (p15==0)) * (((p34==0)||(p35==0))||(p39==0)))) ...1031
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Detected timeout of ITS tools.
[2024-05-30 02:06:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:06:04] [INFO ] Applying decomposition
[2024-05-30 02:06:04] [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/graph10807766832161172020.txt' '-o' '/tmp/graph10807766832161172020.bin' '-w' '/tmp/graph10807766832161172020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10807766832161172020.bin' '-l' '-1' '-v' '-w' '/tmp/graph10807766832161172020.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:06:04] [INFO ] Decomposing Gal with order
[2024-05-30 02:06:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:06:04] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:06:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2024-05-30 02:06:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17320265241169079922.gal : 1 ms
[2024-05-30 02:06:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12743275488540340148.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/CTLFireability17320265241169079922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12743275488540340148.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.514245,23824,424,29,32152,403,105,133734,31,2475,0


Converting to forward existential form...Done !
original formula: AF(((EX(((AX((((i2.u11.p38==0)||(i2.u12.p44==0))||(i3.u15.p51==0))) * (i0.u4.p15==0)) * (((i2.u9.p34==0)||(i2.u10.p35==0))||(i2.u11.p39==...722
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((!(EX(!((((i2.u11.p38==0)||(i2.u12.p44==0))||(i3.u15.p51==0))))) * (i0.u4.p15==0)) * (((i2.u9...1483
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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.
[2024-05-30 02:06:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:06:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:06:34] [INFO ] Applying decomposition
[2024-05-30 02:06:34] [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/graph7670481995454239368.txt' '-o' '/tmp/graph7670481995454239368.bin' '-w' '/tmp/graph7670481995454239368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7670481995454239368.bin' '-l' '-1' '-v' '-w' '/tmp/graph7670481995454239368.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:06:34] [INFO ] Decomposing Gal with order
[2024-05-30 02:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:06:34] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 1 ms.
[2024-05-30 02:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16337379667878701231.gal : 1 ms
[2024-05-30 02:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6378413548422909206.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/CTLFireability16337379667878701231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6378413548422909206.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 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,1.46374e+08,0.574341,26200,518,29,36411,399,112,150718,31,2465,0


Converting to forward existential form...Done !
original formula: E((EF(AX((i0.u4.p15==1))) + AG((EG(AG((i0.u4.p14==1))) + ((AX((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p25==1))) * A((i0.u3.p10==1) U ((...299
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U !(EX(!((i0.u4.p15==1))))) + !(E(TRUE U !((EG(!(E(TRUE U !((i0.u4.p14==1))))) + ((!(EX(!(((...514
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t43, t49, t52, t55, i0.t75, i0.t39, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t3, i0.u4.t...513
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,1,101.462,1558984,1,0,1.57458e+06,465,811,1.05594e+07,130,2465,615377
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(!((!(AX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1)))) * EF(!((((i2.u11.p38==1)&&(i0.u1.p3==1))&&((i1.u5.p20==1)&&(i1.u8.p30==1))...469
=> equivalent forward existential formula: [(FwdU((((FwdU((Init * !(E(!((!(!(EX(!((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1)))))) * E(TRUE U !((((i2....601
(forward)formula 1,1,249.209,2208576,1,0,2.15223e+06,467,317,1.48449e+07,85,2465,314632
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(AX(AG((i0.u4.p14==0)))) * (EX(((EG((((i0.u0.p2==0)||(i0.u1.p6==0))||(i0.u4.p15==0))) + EG(((((i2.u9.p31==1)&&(i3.u13.p48==1))&&(i3.u1...293
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(!(E(TRUE U !((i0.u4.p14==0))))))))))] = FALSE * [FwdG((Init * !(EX(((EG((((i0.u0.p2=...399
(forward)formula 2,1,366.703,2444856,1,0,2.21703e+06,467,264,1.53443e+07,76,2465,68545
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i3.u15.p54==1)&&(i3.u16.p56==1))&&(i1.u6.p0!=1)) U AG(EF(!(((AF((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p26==1))) * (i1.u5.p19==1)...196
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(((!(EG(!((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p26==1))))) * (i1.u5...587
(forward)formula 3,1,423.731,2444856,1,0,2.21703e+06,467,326,1.53443e+07,80,2465,379548
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EG((((AF(EX((((i2.u11.p38==0)||(i2.u12.p42==0))||(i3.u15.p51==0)))) * !(A((((i1.u5.p17==1)&&(i2.u9.p34==1))&&(i2.u12.p44==1)) U (((i0.u...651
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !((EG((((!(EG(!(EX((((i2.u11.p38==0)||(i2.u12.p42==0))||(i3.u15.p51==0)))))) * !(!((E(!((((i...1130
(forward)formula 4,1,817.038,3193000,1,0,3.10537e+06,467,249,2.08718e+07,79,2465,54592
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EG(((EX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1))) + (i2.u9.p32==0)) + E(EF((((i0.u0.p2==1)&&(i0.u1.p6==1))&&(i0.u4.p15==1))) ...193
=> equivalent forward existential formula: [(EY(Init) * !(EG(((EX((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p30==1))) + (i2.u9.p32==0)) + E(E(TRUE U (((i0.u...246
(forward)formula 5,1,992.44,3193088,1,0,3.10537e+06,467,391,2.08718e+07,83,2465,754227
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AF(AG((((i1.u5.p20==0)||(i1.u6.p21==0))||(i1.u7.p26==0)))) + (AG(((A((((i0.u1.p5==1)&&(i0.u2.p7==1))&&(i0.u3.p12==1)) U (i0.u1.p5==1)...318
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((((i1.u5.p20==0)||(i1.u6.p21==0))||(i1.u7.p26==0)))))))) + (!(E(TRUE U !(((!((E(...458
(forward)formula 6,0,1120.92,3708836,1,0,3.43388e+06,467,293,2.29585e+07,80,2465,155278
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A((i0.u4.p15==1) U (EX(E(AG((i0.u4.p15==1)) U AF((i1.u6.p0==1)))) + A(((((i0.u1.p6==1)&&(i0.u2.p7==1))&&(i0.u3.p11==1)) + A((((i0.u1.p6...458
=> equivalent forward existential formula: ([(((FwdU(Init,!((EX(E(!(E(TRUE U !((i0.u4.p15==1)))) U !(EG(!((i1.u6.p0==1)))))) + !((E(!((((((i3.u13.p47==1)&&...3134
(forward)formula 7,1,1430.6,4103780,1,0,3.9662e+06,467,234,2.57745e+07,73,2465,301707
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-30 02:32:03] [INFO ] Applying decomposition
[2024-05-30 02:32:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:32:03] [INFO ] Decomposing Gal with order
[2024-05-30 02:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:32:03] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-30 02:32:03] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 1 ms.
[2024-05-30 02:32:03] [INFO ] Time to serialize gal into /tmp/CTLFireability64797336734479030.gal : 1 ms
[2024-05-30 02:32:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4353648467969366552.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/CTLFireability64797336734479030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4353648467969366552.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 -...260
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46374e+08,0.157096,11620,490,28,16391,103,125,30659,29,267,0


Converting to forward existential form...Done !
original formula: EF(((EF((EG((((u14.p47==0)||(u15.p49==0))||(u16.p54==0))) * AG((((u8.p24==0)||(u9.p28==0))||(u12.p37==0))))) * A(((u11.p36==1)&&(u13.p41=...296
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (E(TRUE U (EG((((u14.p47==0)||(u15.p49==0))||(u16.p54==0))) * !(E(TRUE U !((((u8.p24==...498
Reverse transition relation is NOT exact ! Due to transitions t26, t30, t34, t40, t43, t47, t52, t58, t60, t67, t72, t74, u2.t0, u2.t1, u4.t2, u4.t3, u5.t4...422
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 17
(forward)formula 0,1,30.3083,1201596,1,0,2.22924e+06,147,762,5.32178e+06,125,284,1786954
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(E(AF((((u14.p47==1)&&(u15.p49==1))&&(u16.p53==1))) U (((u2.p3==1)&&(u6.p20==1))&&(u9.p29==1))) U AX((((u14.p48==1)&&(u15.p49==1))&&(u16...166
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((((u14.p48==1)&&(u15.p49==1))&&(u16.p54==1))))))))) * !(E(!(!(EX(!((((u14.p48==1)&&(u15....363
(forward)formula 1,0,31.6259,1262052,1,0,2.35077e+06,147,800,5.594e+06,125,284,1874609
FORMULA ShieldRVs-PT-004A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((EF((u2.p4==1)) * (((u2.p6==0)||(u3.p7==0))||(u4.p12==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (u2.p4==1)) * (((u2.p6==0)||(u3.p7==0))||(u4.p12==0)))))))] != FALSE
(forward)formula 2,0,49.4688,1828108,1,0,3.37193e+06,147,806,8.0901e+06,125,286,2678868
FORMULA ShieldRVs-PT-004A-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E(!(EG(((AF(((u16.p54==1)&&(u17.p58==1))) * ((((u2.p5==1)&&(u3.p7==1))&&(u4.p12==1))||(u2.p5==1))) * (E((u16.p52==1) U (u8.p24==1)) + ((...578
=> equivalent forward existential formula: ((([((FwdU(Init,!(EG(((!(EG(!(((u16.p54==1)&&(u17.p58==1))))) * ((((u2.p5==1)&&(u3.p7==1))&&(u4.p12==1))||(u2.p5...1305
(forward)formula 3,1,82.8074,2201932,1,0,4.06743e+06,147,556,9.79084e+06,81,286,734411
FORMULA ShieldRVs-PT-004A-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(EF((((u6.p18==1) * !(E((u14.p47==1) U (((u4.p12==1)&&(u5.p16==1))&&(u8.p23==1))))) * E((((u10.p31==1)&&(u14.p46==1))&&(u17.p57==1)) U...365
=> equivalent forward existential formula: [(FwdU((Init * !((EG((((u12.p40==0)||(u13.p44==0))||(u16.p51==0))) * !((E(!((((u14.p45==1)&&(u4.p10==1))&&(!(((u...613
(forward)formula 4,0,122.597,2307004,1,0,4.17955e+06,147,650,1.05127e+07,83,286,2923635
FORMULA ShieldRVs-PT-004A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((EX(((AX((((u12.p38==0)||(u13.p44==0))||(u16.p51==0))) * (u5.p15==0)) * (((u10.p34==0)||(u11.p35==0))||(u12.p39==0)))) * A(A(((((u2.p...618
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((!(EX(!((((u12.p38==0)||(u13.p44==0))||(u16.p51==0))))) * (u5.p15==0)) * (((u10.p34==0)||(u11...1281
(forward)formula 5,0,178.547,2854208,1,0,5.25371e+06,147,507,1.27998e+07,80,286,1449376
FORMULA ShieldRVs-PT-004A-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1717036502920

--------------------
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="ShieldRVs-PT-004A"
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 ShieldRVs-PT-004A, 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-171683761800754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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