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.r576-smll-171734919900050.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 MedleyA-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717355751712

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 19:15:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:15:54] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-02 19:15:54] [INFO ] Transformed 145 places.
[2024-06-02 19:15:54] [INFO ] Transformed 287 transitions.
[2024-06-02 19:15:54] [INFO ] Found NUPN structural information;
[2024-06-02 19:15:54] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
Support contains 96 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 135 transition count 279
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 135 transition count 279
Applied a total of 14 rules in 73 ms. Remains 135 /143 variables (removed 8) and now considering 279/285 (removed 6) transitions.
// Phase 1: matrix 279 rows 135 cols
[2024-06-02 19:15:55] [INFO ] Computed 10 invariants in 25 ms
[2024-06-02 19:15:55] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-02 19:15:55] [INFO ] Invariant cache hit.
[2024-06-02 19:15:55] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-06-02 19:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:00] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 29 ms to minimize.
[2024-06-02 19:16:00] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:16:01] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/20 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 4/24 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:05] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:16:06] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:16:06] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:16:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:16:06] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 5/29 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/29 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 279/414 variables, 135/164 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 165 constraints, problems are : Problem set: 48 solved, 230 unsolved in 23039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 48 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/30 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/30 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 279/414 variables, 135/165 constraints. Problems are: Problem set: 48 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 230/395 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:26] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:16:27] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:16:27] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:16:27] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:16:27] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 10/405 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:34] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:16:35] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:16:35] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/408 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:41] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:16:41] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 2/410 constraints. Problems are: Problem set: 48 solved, 230 unsolved
[2024-06-02 19:16:49] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:16:49] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:16:49] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 413 constraints, problems are : Problem set: 48 solved, 230 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 230/278 constraints, Known Traps: 38/38 constraints]
After SMT, in 53997ms problems are : Problem set: 48 solved, 230 unsolved
Search for dead transitions found 48 dead transitions in 54052ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 231/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55002 ms. Remains : 135/143 places, 231/285 transitions.
Support contains 96 out of 135 places after structural reductions.
[2024-06-02 19:16:50] [INFO ] Flatten gal took : 103 ms
[2024-06-02 19:16:50] [INFO ] Flatten gal took : 44 ms
[2024-06-02 19:16:50] [INFO ] Input system was already deterministic with 231 transitions.
RANDOM walk for 40000 steps (1400 resets) in 2890 ms. (13 steps per ms) remains 70/100 properties
BEST_FIRST walk for 4002 steps (30 resets) in 58 ms. (67 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (30 resets) in 38 ms. (102 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (32 resets) in 39 ms. (100 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (32 resets) in 59 ms. (66 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 43 ms. (90 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (27 resets) in 67 ms. (58 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (30 resets) in 44 ms. (88 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (29 resets) in 42 ms. (93 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 58 ms. (67 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (31 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (30 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (30 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (31 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (27 resets) in 38 ms. (102 steps per ms) remains 70/70 properties
// Phase 1: matrix 231 rows 135 cols
[2024-06-02 19:16:51] [INFO ] Computed 10 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/104 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 62 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 3 (OVERLAPS) 24/128 variables, 6/10 constraints. Problems are: Problem set: 13 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 226/354 variables, 128/138 constraints. Problems are: Problem set: 13 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/138 constraints. Problems are: Problem set: 13 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 9/363 variables, 5/143 constraints. Problems are: Problem set: 13 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 13 solved, 57 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/366 variables, 2/145 constraints. Problems are: Problem set: 14 solved, 56 unsolved
[2024-06-02 19:16:55] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-06-02 19:16:55] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:16:55] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:16:55] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:16:55] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 5/150 constraints. Problems are: Problem set: 15 solved, 55 unsolved
[2024-06-02 19:16:56] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:16:56] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:16:56] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:16:56] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 4/154 constraints. Problems are: Problem set: 15 solved, 55 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 154 constraints, problems are : Problem set: 15 solved, 55 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 55 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/102 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 17 solved, 53 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/128 variables, 6/10 constraints. Problems are: Problem set: 20 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/19 constraints. Problems are: Problem set: 20 solved, 50 unsolved
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 3 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 6/25 constraints. Problems are: Problem set: 20 solved, 50 unsolved
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 11 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 6/31 constraints. Problems are: Problem set: 20 solved, 50 unsolved
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:17:00] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:17:00] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 3/34 constraints. Problems are: Problem set: 20 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/34 constraints. Problems are: Problem set: 20 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 226/354 variables, 128/162 constraints. Problems are: Problem set: 20 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 47/209 constraints. Problems are: Problem set: 20 solved, 50 unsolved
[2024-06-02 19:17:01] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/210 constraints. Problems are: Problem set: 20 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/366 variables, and 210 constraints, problems are : Problem set: 20 solved, 50 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/135 constraints, PredecessorRefiner: 47/70 constraints, Known Traps: 25/25 constraints]
After SMT, in 10207ms problems are : Problem set: 20 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 130 transition count 218
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 126 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 125 transition count 217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 17 place count 125 transition count 211
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 29 place count 119 transition count 211
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 40 place count 108 transition count 199
Iterating global reduction 3 with 11 rules applied. Total rules applied 51 place count 108 transition count 199
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 65 place count 101 transition count 192
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 75 place count 96 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 79 place count 96 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 105 place count 96 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 96 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 95 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 107 place count 95 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 109 place count 94 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 94 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 111 place count 93 transition count 176
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 113 place count 93 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 114 place count 92 transition count 175
Applied a total of 114 rules in 97 ms. Remains 92 /135 variables (removed 43) and now considering 175/231 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 92/135 places, 175/231 transitions.
RANDOM walk for 40000 steps (3272 resets) in 803 ms. (49 steps per ms) remains 23/50 properties
BEST_FIRST walk for 4004 steps (62 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (64 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (63 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (63 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (65 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (65 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (62 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (62 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (65 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (62 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (59 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (62 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (68 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 11 ms. (333 steps per ms) remains 19/23 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (68 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
// Phase 1: matrix 175 rows 92 cols
[2024-06-02 19:17:02] [INFO ] Computed 8 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/84 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 171/255 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 12/267 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 100 constraints, problems are : Problem set: 0 solved, 19 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/84 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 171/255 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:17:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 12/267 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:17:05] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:17:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:17:05] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:17:05] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 124 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
After SMT, in 3809ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 16 properties in 6952 ms.
Support contains 13 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 175/175 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 92 transition count 161
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 23 place count 83 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 23 place count 83 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 80 transition count 158
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 42 place count 67 transition count 144
Iterating global reduction 2 with 13 rules applied. Total rules applied 55 place count 67 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 60 transition count 137
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 52 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 93 place count 52 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 52 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 51 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 51 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 49 transition count 176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 49 transition count 176
Applied a total of 100 rules in 45 ms. Remains 49 /92 variables (removed 43) and now considering 176/175 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 49/92 places, 176/175 transitions.
RANDOM walk for 40000 steps (4220 resets) in 245 ms. (162 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (880 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
// Phase 1: matrix 176 rows 49 cols
[2024-06-02 19:17:13] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:17:13] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/42 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/217 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/225 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/42 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/217 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/225 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 176/176 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 49 transition count 175
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 48 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 44 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 43 transition count 171
Applied a total of 11 rules in 16 ms. Remains 43 /49 variables (removed 6) and now considering 171/176 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 43/49 places, 171/176 transitions.
RANDOM walk for 40000 steps (4280 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (911 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 25772 steps, run visited all 1 properties in 119 ms. (steps per millisecond=216 )
Probabilistic random walk after 25772 steps, saw 6979 distinct states, run finished after 127 ms. (steps per millisecond=202 ) properties seen :1
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:17:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:17:14] [INFO ] Flatten gal took : 32 ms
FORMULA MedleyA-PT-07-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:17:14] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:17:14] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 64 out of 135 places (down from 71) after GAL structural reductions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 132 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 131 transition count 205
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 109 transition count 201
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 107 transition count 199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 54 place count 107 transition count 195
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 103 transition count 195
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 88 place count 77 transition count 162
Iterating global reduction 3 with 26 rules applied. Total rules applied 114 place count 77 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 114 place count 77 transition count 160
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 75 transition count 160
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 142 place count 62 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 61 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 61 transition count 147
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 3 with 2 rules applied. Total rules applied 146 place count 60 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 60 transition count 139
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 60 transition count 136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 57 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 159 place count 57 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 55 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 167 place count 53 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 52 transition count 131
Applied a total of 168 rules in 71 ms. Remains 52 /135 variables (removed 83) and now considering 131/231 (removed 100) transitions.
// Phase 1: matrix 131 rows 52 cols
[2024-06-02 19:17:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:17:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:17:14] [INFO ] Invariant cache hit.
[2024-06-02 19:17:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:17:14] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-06-02 19:17:14] [INFO ] Redundant transitions in 18 ms returned []
Running 123 sub problems to find dead transitions.
[2024-06-02 19:17:14] [INFO ] Invariant cache hit.
[2024-06-02 19:17:14] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 131/183 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 71 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 131/183 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 123/194 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 194 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 7821ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 7823ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/135 places, 131/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8164 ms. Remains : 52/135 places, 131/231 transitions.
[2024-06-02 19:17:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:17:22] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:17:22] [INFO ] Input system was already deterministic with 131 transitions.
[2024-06-02 19:17:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:17:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:17:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16039607843920660426.gal : 8 ms
[2024-06-02 19:17:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5947313829092647441.ctl : 15 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/CTLFireability16039607843920660426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5947313829092647441.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,397300,0.23441,7164,2,326,5,14145,6,0,330,17156,0


Converting to forward existential form...Done !
original formula: EF(EG(((p135==1)&&(p138==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p135==1)&&(p138==1)))] != FALSE
Hit Full ! (commute/partial/dont) 126/4/5
(forward)formula 0,1,0.403689,8736,1,0,9,26257,19,2,2165,20333,8
FORMULA MedleyA-PT-07-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 107 transition count 199
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 105 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 105 transition count 195
Applied a total of 60 rules in 23 ms. Remains 105 /135 variables (removed 30) and now considering 195/231 (removed 36) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 19:17:23] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:17:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 19:17:23] [INFO ] Invariant cache hit.
[2024-06-02 19:17:23] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 19:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:17:25] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:17:26] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:17:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 124 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:17:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:17:38] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:17:43] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/300 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/300 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 321 constraints, problems are : Problem set: 0 solved, 194 unsolved in 15442 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 12/12 constraints]
After SMT, in 26797ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 26801ms
Starting structural reductions in LTL mode, iteration 1 : 105/135 places, 195/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27193 ms. Remains : 105/135 places, 195/231 transitions.
[2024-06-02 19:17:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:17:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:17:50] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 19:17:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:17:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:17:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12008708793903739879.gal : 5 ms
[2024-06-02 19:17:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14565228216336038758.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/CTLFireability12008708793903739879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14565228216336038758.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.61256e+07,1.40156,40096,2,4345,5,118688,6,0,615,174163,0


Converting to forward existential form...Done !
original formula: E(AX(EF((p64==1))) U AG((p93==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E(TRUE U (p64==1)))))) * !(E(TRUE U !((p93==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...467
(forward)formula 0,0,4.37984,91036,1,0,359,436088,412,141,4878,350871,400
FORMULA MedleyA-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 203
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 199
Applied a total of 56 rules in 14 ms. Remains 107 /135 variables (removed 28) and now considering 199/231 (removed 32) transitions.
// Phase 1: matrix 199 rows 107 cols
[2024-06-02 19:17:54] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:17:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:17:54] [INFO ] Invariant cache hit.
[2024-06-02 19:17:55] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-02 19:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:17:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:17:58] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:17:58] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/306 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 124 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10337 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/306 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 198/322 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:18:10] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:18:10] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:18:17] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/306 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 325 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22645 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints]
After SMT, in 33173ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 33176ms
Starting structural reductions in LTL mode, iteration 1 : 107/135 places, 199/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33514 ms. Remains : 107/135 places, 199/231 transitions.
[2024-06-02 19:18:28] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:18:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:18:28] [INFO ] Input system was already deterministic with 199 transitions.
[2024-06-02 19:18:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:18:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:18:28] [INFO ] Time to serialize gal into /tmp/CTLFireability880503373317987131.gal : 2 ms
[2024-06-02 19:18:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13987878981442345308.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/CTLFireability880503373317987131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13987878981442345308.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.84176e+07,2.06459,54440,2,4691,5,152852,6,0,627,258525,0


Converting to forward existential form...Done !
original formula: A(E(AF(E((p115==1) U (p142==1))) U ((p98!=1) * EX(AG((p42==1))))) U (((AX(AX(FALSE)) + A(((p40==1)&&(p60==1)) U (p57==1))) + (AX(FALSE) +...215
=> equivalent forward existential formula: [((Init * !(EG(!((((!(EX(!(!(EX(!(FALSE)))))) + !((E(!((p57==1)) U (!(((p40==1)&&(p60==1))) * !((p57==1)))) + EG...755
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...527
Detected timeout of ITS tools.
[2024-06-02 19:18:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:18:58] [INFO ] Applying decomposition
[2024-06-02 19:18:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14327966352396419270.txt' '-o' '/tmp/graph14327966352396419270.bin' '-w' '/tmp/graph14327966352396419270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14327966352396419270.bin' '-l' '-1' '-v' '-w' '/tmp/graph14327966352396419270.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:18:58] [INFO ] Decomposing Gal with order
[2024-06-02 19:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:18:58] [INFO ] Removed a total of 298 redundant transitions.
[2024-06-02 19:18:58] [INFO ] Flatten gal took : 107 ms
[2024-06-02 19:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 24 ms.
[2024-06-02 19:18:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10908505734132628985.gal : 8 ms
[2024-06-02 19:18:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14330046242925488107.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/CTLFireability10908505734132628985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14330046242925488107.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.84176e+07,0.363969,13324,500,79,17159,713,372,45226,80,3313,0


Converting to forward existential form...Done !
original formula: A(E(AF(E((i6.u25.p115==1) U (i7.i1.u34.p142==1))) U ((i5.u21.p98!=1) * EX(AG((i3.u11.p42==1))))) U (((AX(AX(FALSE)) + A(((i2.u6.p40==1)&&...298
=> equivalent forward existential formula: [((Init * !(EG(!((((!(EX(!(!(EX(!(FALSE)))))) + !((E(!((i3.u13.p57==1)) U (!(((i2.u6.p40==1)&&(i3.u14.p60==1))) ...984
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u2.t107, i1.u5.t104, i2.t97, i2.t96, i2.t95, i2.t92, i2.t91, i2.u6.t70, i2.u6.t1...905
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
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 : 135/135 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 106 transition count 198
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 104 transition count 194
Applied a total of 62 rules in 7 ms. Remains 104 /135 variables (removed 31) and now considering 194/231 (removed 37) transitions.
// Phase 1: matrix 194 rows 104 cols
[2024-06-02 19:19:29] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:19:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:19:29] [INFO ] Invariant cache hit.
[2024-06-02 19:19:29] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 19:19:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 19:19:31] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 4 ms to minimize.
[2024-06-02 19:19:31] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:19:31] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:19:31] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:19:32] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:19:32] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9580 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 23908ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 23914ms
Starting structural reductions in LTL mode, iteration 1 : 104/135 places, 194/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24176 ms. Remains : 104/135 places, 194/231 transitions.
[2024-06-02 19:19:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:19:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:19:53] [INFO ] Input system was already deterministic with 194 transitions.
[2024-06-02 19:19:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:19:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:19:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12698941055810838482.gal : 2 ms
[2024-06-02 19:19:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15819029462702631383.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/CTLFireability12698941055810838482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15819029462702631383.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.55422e+07,1.21966,39412,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: AF(AG(((AX((p62==0)) + (p79==0)) + ((p117==0)||(p142==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((p62==0)))) + (p79==0)) + ((p117==0)||(p142==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
(forward)formula 0,1,4.32401,99648,1,0,394,425785,416,143,4867,425194,436
FORMULA MedleyA-PT-07-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 110 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 110 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 108 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 108 transition count 199
Applied a total of 54 rules in 5 ms. Remains 108 /135 variables (removed 27) and now considering 199/231 (removed 32) transitions.
// Phase 1: matrix 199 rows 108 cols
[2024-06-02 19:19:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:19:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 19:19:57] [INFO ] Invariant cache hit.
[2024-06-02 19:19:57] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-02 19:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:20:00] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 3 ms to minimize.
[2024-06-02 19:20:00] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:20:00] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:20:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:20:01] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:20:01] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:20:01] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/307 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 125 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10057 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/307 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 198/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:20:16] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/307 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:20:20] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 19:20:23] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:20:23] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/307 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 327 constraints, problems are : Problem set: 0 solved, 198 unsolved in 26128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 11/11 constraints]
After SMT, in 36315ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 36317ms
Starting structural reductions in LTL mode, iteration 1 : 108/135 places, 199/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36635 ms. Remains : 108/135 places, 199/231 transitions.
[2024-06-02 19:20:34] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:20:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:20:34] [INFO ] Input system was already deterministic with 199 transitions.
[2024-06-02 19:20:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:20:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14576399679219726639.gal : 3 ms
[2024-06-02 19:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15935898136420805692.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/CTLFireability14576399679219726639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15935898136420805692.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15335e+07,2.40364,65920,2,6006,5,184333,6,0,631,320419,0


Converting to forward existential form...Done !
original formula: EF(((A(EF((((p20==1)&&(p32==1))&&((p79==1)&&(p117==1)))) U A(AG((p15==1)) U AX(((p40==1)&&(p60==1))))) + (p31==1)) + (((E((((p20==1)&&(p3...432
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(!((E(!(!(EX(!(((p40==1)&&(p60==1)))))) U (!(!(E(TRUE U !((p15==1))))) * !(!(EX(!((...1587
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t36...517
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 19:21:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:21:04] [INFO ] Applying decomposition
[2024-06-02 19:21:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7799382765697671485.txt' '-o' '/tmp/graph7799382765697671485.bin' '-w' '/tmp/graph7799382765697671485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7799382765697671485.bin' '-l' '-1' '-v' '-w' '/tmp/graph7799382765697671485.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:21:04] [INFO ] Decomposing Gal with order
[2024-06-02 19:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:21:04] [INFO ] Removed a total of 281 redundant transitions.
[2024-06-02 19:21:04] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 8 ms.
[2024-06-02 19:21:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1419567868568642148.gal : 18 ms
[2024-06-02 19:21:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15694317743060528602.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/CTLFireability1419567868568642148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15694317743060528602.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15335e+07,0.617355,16860,618,177,21365,1501,408,63504,104,12435,0


Converting to forward existential form...Done !
original formula: EF(((A(EF((((i3.u3.p20==1)&&(i2.u6.p32==1))&&((i6.i0.u15.p79==1)&&(i6.i0.u15.p117==1)))) U A(AG((i3.u3.p15==1)) U AX(((i2.u8.p40==1)&&(i3...668
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(!((E(!(!(EX(!(((i2.u8.p40==1)&&(i3.u12.p60==1)))))) U (!(!(E(TRUE U !((i3.u3.p15==...2241
Reverse transition relation is NOT exact ! Due to transitions t34, t75, i1.u2.t108, i1.u4.t103, i2.t96, i2.t91, i2.t90, i2.u5.t98, i2.u5.t99, i2.u5.t100, i...928
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,15.0069,427360,1,0,632172,11210,2504,2.33498e+06,517,108383,451727
FORMULA MedleyA-PT-07-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 108 transition count 200
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 108 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 106 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 106 transition count 196
Applied a total of 58 rules in 4 ms. Remains 106 /135 variables (removed 29) and now considering 196/231 (removed 35) transitions.
// Phase 1: matrix 196 rows 106 cols
[2024-06-02 19:21:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:21:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:21:19] [INFO ] Invariant cache hit.
[2024-06-02 19:21:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-02 19:21:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:21:22] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:21:22] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:21:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:21:22] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 120 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9888 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 195/315 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:21:34] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:21:35] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 317 constraints, problems are : Problem set: 0 solved, 195 unsolved in 16392 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 6/6 constraints]
After SMT, in 26404ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26406ms
Starting structural reductions in LTL mode, iteration 1 : 106/135 places, 196/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26627 ms. Remains : 106/135 places, 196/231 transitions.
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:21:46] [INFO ] Input system was already deterministic with 196 transitions.
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:21:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9295642358120241950.gal : 3 ms
[2024-06-02 19:21:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2072335941328045162.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/CTLFireability9295642358120241950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2072335941328045162.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.55928e+07,1.66754,48368,2,3838,5,151012,6,0,620,211654,0


Converting to forward existential form...Done !
original formula: AX(A(AF((AF((p83==1)) + A((p115==1) U (p86==1)))) U (AG(A(((p79==1)&&(p114==1)) U (p0==1))) + AG(EF((p80==1))))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(EY(Init),!((!(E(TRUE U !(!((E(!((p0==1)) U (!(((p79==1)&&(p114==1))) * !((p0==1)))) + EG(!((p0==1...615
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...488
Detected timeout of ITS tools.
[2024-06-02 19:22:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:22:16] [INFO ] Applying decomposition
[2024-06-02 19:22:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5641384344549926651.txt' '-o' '/tmp/graph5641384344549926651.bin' '-w' '/tmp/graph5641384344549926651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5641384344549926651.bin' '-l' '-1' '-v' '-w' '/tmp/graph5641384344549926651.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:22:16] [INFO ] Decomposing Gal with order
[2024-06-02 19:22:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:22:16] [INFO ] Removed a total of 261 redundant transitions.
[2024-06-02 19:22:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2024-06-02 19:22:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3261799657427620007.gal : 2 ms
[2024-06-02 19:22:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7863066315707285615.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/CTLFireability3261799657427620007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7863066315707285615.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.55928e+07,0.214979,9080,403,98,9915,622,363,23170,91,2952,0


Converting to forward existential form...Done !
original formula: AX(A(AF((AF((i5.u17.p83==1)) + A((i4.u23.p115==1) U (i6.u20.p86==1)))) U (AG(A(((i4.u16.p79==1)&&(i4.u23.p114==1)) U (i3.i0.u0.p0==1))) +...185
=> equivalent forward existential formula: ([(FwdU(((FwdU(EY(Init),!((!(E(TRUE U !(!((E(!((i3.i0.u0.p0==1)) U (!(((i4.u16.p79==1)&&(i4.u23.p114==1))) * !((...803
Reverse transition relation is NOT exact ! Due to transitions t34, t65, t74, i0.u2.t105, i0.u4.t102, i1.t95, i1.t94, i1.t93, i1.t90, i1.t89, i1.u5.t97, i1....871
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.92968,233040,1,0,338970,4045,2456,1.1968e+06,505,33454,281491
FORMULA MedleyA-PT-07-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 106 transition count 198
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 104 transition count 194
Applied a total of 62 rules in 4 ms. Remains 104 /135 variables (removed 31) and now considering 194/231 (removed 37) transitions.
// Phase 1: matrix 194 rows 104 cols
[2024-06-02 19:22:24] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:22:24] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:22:24] [INFO ] Invariant cache hit.
[2024-06-02 19:22:24] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 19:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9884 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 19:22:39] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:22:39] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14377 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 24460ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 24464ms
Starting structural reductions in LTL mode, iteration 1 : 104/135 places, 194/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24703 ms. Remains : 104/135 places, 194/231 transitions.
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Input system was already deterministic with 194 transitions.
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11628233484332646101.gal : 3 ms
[2024-06-02 19:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17736318537298565728.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/CTLFireability11628233484332646101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17736318537298565728.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.55422e+07,1.42746,39448,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: AG((AF((EX((p94==1)) * EG((((p20==1)&&(p32==1))&&((p79==1)&&(p117==1)))))) + EX((((p20==1)&&(p32==1))&&((p71==1)&&(p84==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX((((p20==1)&&(p32==1))&&((p71==1)&&(p84==1)))))),!((EX((p94==1)) * EG((((p20==1)&&(...200
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
(forward)formula 0,0,4.98759,111080,1,0,478,523270,414,181,5174,478278,553
FORMULA MedleyA-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 197
Applied a total of 56 rules in 4 ms. Remains 107 /135 variables (removed 28) and now considering 197/231 (removed 34) transitions.
// Phase 1: matrix 197 rows 107 cols
[2024-06-02 19:22:54] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:22:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:22:54] [INFO ] Invariant cache hit.
[2024-06-02 19:22:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-02 19:22:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:22:56] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:23:03] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/304 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/304 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 123 constraints, problems are : Problem set: 0 solved, 196 unsolved in 14921 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:23:11] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/304 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 196/320 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:23:15] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:23:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:23:16] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:23:23] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:23:23] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:23:23] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/304 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:23:26] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 327 constraints, problems are : Problem set: 0 solved, 196 unsolved in 27480 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 14/14 constraints]
After SMT, in 42516ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 42519ms
Starting structural reductions in LTL mode, iteration 1 : 107/135 places, 197/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42714 ms. Remains : 107/135 places, 197/231 transitions.
[2024-06-02 19:23:37] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:23:37] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:23:37] [INFO ] Input system was already deterministic with 197 transitions.
[2024-06-02 19:23:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:23:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16069542721058385589.gal : 3 ms
[2024-06-02 19:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9608061459968016035.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/CTLFireability16069542721058385589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9608061459968016035.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.88967e+07,2.29019,65448,2,6316,5,186856,6,0,625,309039,0


Converting to forward existential form...Done !
original formula: EF((((EX((p19==0)) * AF((p24==0))) * (!(E((p33==1) U (((p20==1)&&(p32==1))&&((p79==1)&&(p117==1))))) * (p87==0))) * ((!(A((p112==1) U ((p...286
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((EX((p19==0)) * !(EG(!((p24==0))))) * (!(E((p33==1) U (((p20==1)&&(p32==1))&&((p79==1)&&...735
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...510
Detected timeout of ITS tools.
[2024-06-02 19:24:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:24:07] [INFO ] Applying decomposition
[2024-06-02 19:24:07] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9020055221773851646.txt' '-o' '/tmp/graph9020055221773851646.bin' '-w' '/tmp/graph9020055221773851646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9020055221773851646.bin' '-l' '-1' '-v' '-w' '/tmp/graph9020055221773851646.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:24:07] [INFO ] Decomposing Gal with order
[2024-06-02 19:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:24:07] [INFO ] Removed a total of 269 redundant transitions.
[2024-06-02 19:24:07] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2024-06-02 19:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15664120924071965225.gal : 2 ms
[2024-06-02 19:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8767231100110583667.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/CTLFireability15664120924071965225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8767231100110583667.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.88967e+07,0.390852,15460,545,177,20988,1534,348,55041,93,11145,0


Converting to forward existential form...Done !
original formula: EF((((EX((i3.u3.p19==0)) * AF((i1.u4.p24==0))) * (!(E((i2.u6.p33==1) U (((i3.u3.p20==1)&&(i2.u6.p32==1))&&((i6.u15.p79==1)&&(i6.u15.p117=...413
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((EX((i3.u3.p19==0)) * !(EG(!((i1.u4.p24==0))))) * (!(E((i2.u6.p33==1) U (((i3.u3.p20==1)...1011
Reverse transition relation is NOT exact ! Due to transitions t34, t73, i1.u2.t106, i1.u4.t101, i1.u4.t102, i2.t94, i2.t89, i2.t88, i2.u5.t96, i2.u5.t97, i...833
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,23.4067,617740,1,0,869598,8165,2185,3.40944e+06,473,92229,595840
FORMULA MedleyA-PT-07-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Graph (complete) has 410 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 129 transition count 204
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 107 transition count 200
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 105 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 54 place count 105 transition count 196
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 103 transition count 196
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 84 place count 77 transition count 163
Iterating global reduction 3 with 26 rules applied. Total rules applied 110 place count 77 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 110 place count 77 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 75 transition count 161
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 138 place count 62 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 61 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 61 transition count 148
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 3 with 2 rules applied. Total rules applied 142 place count 60 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 149 place count 60 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 60 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 57 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 155 place count 57 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 55 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 53 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 52 transition count 132
Applied a total of 164 rules in 53 ms. Remains 52 /135 variables (removed 83) and now considering 132/231 (removed 99) transitions.
// Phase 1: matrix 132 rows 52 cols
[2024-06-02 19:24:30] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:24:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 19:24:30] [INFO ] Invariant cache hit.
[2024-06-02 19:24:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:24:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-02 19:24:30] [INFO ] Redundant transitions in 16 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-02 19:24:30] [INFO ] Invariant cache hit.
[2024-06-02 19:24:30] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 132/184 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 70 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 132/184 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 124/194 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 194 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5242 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 8656ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 8658ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/135 places, 132/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8872 ms. Remains : 52/135 places, 132/231 transitions.
[2024-06-02 19:24:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:24:39] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:39] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 544 steps (55 resets) in 7 ms. (68 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 19:24:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:24:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:24:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8892839522978605461.gal : 2 ms
[2024-06-02 19:24:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10977682803397683975.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8892839522978605461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10977682803397683975.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 111 transition count 204
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 111 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 110 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 110 transition count 202
Applied a total of 50 rules in 3 ms. Remains 110 /135 variables (removed 25) and now considering 202/231 (removed 29) transitions.
// Phase 1: matrix 202 rows 110 cols
[2024-06-02 19:24:39] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:24:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:24:39] [INFO ] Invariant cache hit.
[2024-06-02 19:24:39] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-06-02 19:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:24:42] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:24:42] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:24:42] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:24:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:24:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:24:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:24:43] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:24:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/312 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:24:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/312 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 131 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17391 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:24:59] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/312 variables, 110/132 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 201/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:25:03] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 19:25:06] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:25:07] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/312 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 20661 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 15/15 constraints]
After SMT, in 38163ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 38166ms
Starting structural reductions in LTL mode, iteration 1 : 110/135 places, 202/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38360 ms. Remains : 110/135 places, 202/231 transitions.
[2024-06-02 19:25:18] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:25:18] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:25:18] [INFO ] Input system was already deterministic with 202 transitions.
[2024-06-02 19:25:18] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:25:18] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:25:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17370341676292917553.gal : 2 ms
[2024-06-02 19:25:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9250782665454612233.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/CTLFireability17370341676292917553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9250782665454612233.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.92553e+07,2.0744,54048,2,5961,5,146446,6,0,642,253614,0


Converting to forward existential form...Done !
original formula: (EF(((EX((p115==1)) * EG((p80==1))) + EG(((p49==1)||(p104==1))))) * (!(E(AG(((((p79==1)&&(p114==1))||(p94==1))||((((p67==1)&&(p20==1))&&(...291
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((p115==1)) * EG((p80==1))) + EG(((p49==1)||(p104==1)))))))] = FALSE * [FwdG((Init * !(...475
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t35, t37, t38...539
Detected timeout of ITS tools.
[2024-06-02 19:25:48] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:25:48] [INFO ] Applying decomposition
[2024-06-02 19:25:48] [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/graph7522789810126110031.txt' '-o' '/tmp/graph7522789810126110031.bin' '-w' '/tmp/graph7522789810126110031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7522789810126110031.bin' '-l' '-1' '-v' '-w' '/tmp/graph7522789810126110031.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:25:48] [INFO ] Decomposing Gal with order
[2024-06-02 19:25:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:25:48] [INFO ] Removed a total of 277 redundant transitions.
[2024-06-02 19:25:48] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 5 ms.
[2024-06-02 19:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7855875862911196178.gal : 2 ms
[2024-06-02 19:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8137897280641644795.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/CTLFireability7855875862911196178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8137897280641644795.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.92553e+07,0.473807,18960,593,122,25586,1048,398,79024,97,6756,0


Converting to forward existential form...Done !
original formula: (EF(((EX((i6.u24.p115==1)) * EG((i0.u13.p80==1))) + EG(((i3.u10.p49==1)||(i6.u22.p104==1))))) * (!(E(AG(((((i6.u16.p79==1)&&(i6.u24.p114=...412
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((i6.u24.p115==1)) * EG((i0.u13.p80==1))) + EG(((i3.u10.p49==1)||(i6.u22.p104==1)))))))...622
Reverse transition relation is NOT exact ! Due to transitions t66, t77, i1.u2.t111, i1.u4.t107, i2.t95, i2.t94, i2.u5.t98, i2.u5.t99, i2.u5.t100, i2.u5.t10...937
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 231/231 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 109 transition count 202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 109 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 107 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 107 transition count 198
Applied a total of 56 rules in 3 ms. Remains 107 /135 variables (removed 28) and now considering 198/231 (removed 33) transitions.
// Phase 1: matrix 198 rows 107 cols
[2024-06-02 19:26:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:26:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:26:18] [INFO ] Invariant cache hit.
[2024-06-02 19:26:18] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-06-02 19:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:26:20] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:26:20] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:26:20] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:26:21] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 121 constraints, problems are : Problem set: 0 solved, 197 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 197/318 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:26:33] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:26:33] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:26:33] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:26:34] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:26:34] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:26:37] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:26:38] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:26:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/305 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 326 constraints, problems are : Problem set: 0 solved, 197 unsolved in 20729 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 12/12 constraints]
After SMT, in 30690ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 30693ms
Starting structural reductions in LTL mode, iteration 1 : 107/135 places, 198/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30874 ms. Remains : 107/135 places, 198/231 transitions.
[2024-06-02 19:26:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:26:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:26:49] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 19:26:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:26:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:26:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3074856354188486258.gal : 1 ms
[2024-06-02 19:26:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10543254800416684590.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/CTLFireability3074856354188486258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10543254800416684590.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.92439e+07,2.07604,53124,2,4543,5,153232,6,0,626,244576,0


Converting to forward existential form...Done !
original formula: ((EF(EG(EX(EF((p111==1))))) * E((!(AX((p24==1))) + AF(((p48==1)||(((p20==1)&&(p32==1))&&((p71==1)&&(p117==1)))))) U (A((EX((p97==1)) * A(...303
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((p24==1))))) + !(EG(!(((p...578
Hit Full ! (commute/partial/dont) 191/0/7
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...516
Detected timeout of ITS tools.
[2024-06-02 19:27:19] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:19] [INFO ] Applying decomposition
[2024-06-02 19:27:19] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17550198777251499524.txt' '-o' '/tmp/graph17550198777251499524.bin' '-w' '/tmp/graph17550198777251499524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17550198777251499524.bin' '-l' '-1' '-v' '-w' '/tmp/graph17550198777251499524.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:27:19] [INFO ] Decomposing Gal with order
[2024-06-02 19:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:27:19] [INFO ] Removed a total of 311 redundant transitions.
[2024-06-02 19:27:19] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 13 ms.
[2024-06-02 19:27:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14226683552379444906.gal : 2 ms
[2024-06-02 19:27:19] [INFO ] Time to serialize properties into /tmp/CTLFireability440333959532912473.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/CTLFireability14226683552379444906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability440333959532912473.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.92439e+07,0.315423,13092,483,74,17311,762,385,40413,91,3009,0


Converting to forward existential form...Done !
original formula: ((EF(EG(EX(EF((i6.u22.p111==1))))) * E((!(AX((i1.u5.p24==1))) + AF(((i3.u11.p48==1)||(((i3.u4.p20==1)&&(i2.u8.p32==1))&&((i4.u16.p71==1)&...434
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (i6.u22.p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((i1.u5.p24==1)))))...773
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u2.t107, i1.u5.t102, i1.u5.t103, i2.t95, i2.t94, i2.t93, i2.t90, i2.t89, i2.u6.t...873
Detected timeout of ITS tools.
[2024-06-02 19:27:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:27:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:27:49] [INFO ] Applying decomposition
[2024-06-02 19:27:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15308804316373992035.txt' '-o' '/tmp/graph15308804316373992035.bin' '-w' '/tmp/graph15308804316373992035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15308804316373992035.bin' '-l' '-1' '-v' '-w' '/tmp/graph15308804316373992035.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:27:49] [INFO ] Decomposing Gal with order
[2024-06-02 19:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:27:49] [INFO ] Removed a total of 380 redundant transitions.
[2024-06-02 19:27:49] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2024-06-02 19:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10945696187810626362.gal : 3 ms
[2024-06-02 19:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9306845233636554587.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/CTLFireability10945696187810626362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9306845233636554587.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.49419e+07,1.02536,25936,657,75,31709,417,498,118531,94,1762,0


Converting to forward existential form...Done !
original formula: A(E(AF(E((i8.i1.u30.p115==1) U (i9.i1.u39.p142==1))) U ((i6.u24.p98!=1) * EX(AG((i4.u12.p42==1))))) U (((AX(AX(FALSE)) + A(((i3.u7.p40==1...304
=> equivalent forward existential formula: [((Init * !(EG(!((((!(EX(!(!(EX(!(FALSE)))))) + !((E(!((i4.u14.p57==1)) U (!(((i3.u7.p40==1)&&(i4.u10.p60==1))) ...996
Reverse transition relation is NOT exact ! Due to transitions i1.t129, i1.u4.t135, i1.u4.t138, i1.u4.t139, i1.u4.t140, i1.u4.t141, i1.u5.t130, i1.u5.t131, ...1275
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,59.5545,1344608,1,0,1.99164e+06,1857,3229,4.88423e+06,483,7367,1686338
FORMULA MedleyA-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(((EX((i8.i1.u30.p115==1)) * EG((i7.u19.p80==1))) + EG(((i4.u14.p49==1)||(i8.i0.u27.p104==1))))) * (!(E(AG(((((i7.u18.p79==1)&&(i8.i1....427
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((i8.i1.u30.p115==1)) * EG((i7.u19.p80==1))) + EG(((i4.u14.p49==1)||(i8.i0.u27.p104==1)...637
(forward)formula 1,1,90.0991,1985648,1,0,2.99189e+06,1917,3347,6.92142e+06,484,7554,2614848
FORMULA MedleyA-PT-07-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EF(EG(EX(EF((i8.i1.u29.p111==1))))) * E((!(AX((i2.u6.p24==1))) + AF(((i4.u12.p48==1)||(((i1.u5.p20==1)&&(i3.u8.p32==1))&&((i5.u16.p71==...446
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (i8.i1.u29.p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((i2.u6.p24==1))...785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,1,150.619,2200280,1,0,3.30122e+06,1945,1552,7.71741e+06,237,7716,1570390
FORMULA MedleyA-PT-07-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 866534 ms.

BK_STOP 1717356620763

--------------------
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="MedleyA-PT-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734919900050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-07.tgz
mv MedleyA-PT-07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;