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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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-10-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717359450798

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:17:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:17:33] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-06-02 20:17:33] [INFO ] Transformed 149 places.
[2024-06-02 20:17:33] [INFO ] Transformed 340 transitions.
[2024-06-02 20:17:33] [INFO ] Found NUPN structural information;
[2024-06-02 20:17:33] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 59 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 35 place count 114 transition count 304
Iterating global reduction 1 with 32 rules applied. Total rules applied 67 place count 114 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 114 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 111 transition count 299
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 111 transition count 299
Applied a total of 75 rules in 135 ms. Remains 111 /149 variables (removed 38) and now considering 299/340 (removed 41) transitions.
// Phase 1: matrix 299 rows 111 cols
[2024-06-02 20:17:33] [INFO ] Computed 10 invariants in 36 ms
[2024-06-02 20:17:34] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-02 20:17:34] [INFO ] Invariant cache hit.
[2024-06-02 20:17:34] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-06-02 20:17:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 234 unsolved
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 33 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-06-02 20:17:40] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 3/13 constraints. Problems are: Problem set: 64 solved, 234 unsolved
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/14 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 299/410 variables, 111/125 constraints. Problems are: Problem set: 64 solved, 234 unsolved
[2024-06-02 20:17:47] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:17:48] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 2/127 constraints. Problems are: Problem set: 64 solved, 234 unsolved
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:17:50] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:17:51] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:17:51] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 5/132 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/132 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/132 constraints. Problems are: Problem set: 64 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 132 constraints, problems are : Problem set: 64 solved, 234 unsolved in 23470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 64 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 11/21 constraints. Problems are: Problem set: 64 solved, 234 unsolved
[2024-06-02 20:18:00] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:18:01] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/23 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/23 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 299/410 variables, 111/134 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 234/368 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/368 constraints. Problems are: Problem set: 64 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/368 constraints. Problems are: Problem set: 64 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 368 constraints, problems are : Problem set: 64 solved, 234 unsolved in 20484 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 234/298 constraints, Known Traps: 13/13 constraints]
After SMT, in 45359ms problems are : Problem set: 64 solved, 234 unsolved
Search for dead transitions found 64 dead transitions in 45419ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/149 places, 235/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46489 ms. Remains : 111/149 places, 235/340 transitions.
Support contains 59 out of 111 places after structural reductions.
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 80 ms
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 35 ms
[2024-06-02 20:18:20] [INFO ] Input system was already deterministic with 235 transitions.
RANDOM walk for 40000 steps (1748 resets) in 2690 ms. (14 steps per ms) remains 39/56 properties
BEST_FIRST walk for 4004 steps (40 resets) in 49 ms. (80 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (39 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (41 resets) in 71 ms. (55 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (42 resets) in 68 ms. (58 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 62 ms. (63 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (42 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (39 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 82 ms. (48 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (41 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (42 resets) in 57 ms. (69 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (43 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (39 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (38 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (42 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (36 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (42 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (41 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (42 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (41 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (41 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
// Phase 1: matrix 235 rows 111 cols
[2024-06-02 20:18:21] [INFO ] Computed 10 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 2 (OVERLAPS) 34/79 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 36 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 4 (OVERLAPS) 22/101 variables, 5/10 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 231/332 variables, 101/111 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/111 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 13/345 variables, 9/120 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/121 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/121 constraints. Problems are: Problem set: 9 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/346 variables, 0/121 constraints. Problems are: Problem set: 9 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 121 constraints, problems are : Problem set: 9 solved, 30 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 30 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/78 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 23/101 variables, 6/10 constraints. Problems are: Problem set: 13 solved, 26 unsolved
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/16 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 231/332 variables, 101/117 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 14/131 constraints. Problems are: Problem set: 13 solved, 26 unsolved
[2024-06-02 20:18:25] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 1/132 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/132 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 13/345 variables, 9/141 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 12/153 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/153 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/346 variables, 1/154 constraints. Problems are: Problem set: 13 solved, 26 unsolved
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 157 constraints, problems are : Problem set: 13 solved, 26 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 26/39 constraints, Known Traps: 10/10 constraints]
After SMT, in 6907ms problems are : Problem set: 13 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 235/235 transitions.
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 3 rules applied. Total rules applied 4 place count 110 transition count 231
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 107 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 106 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 106 transition count 226
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 17 place count 102 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 97 transition count 220
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 97 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 97 transition count 219
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 36 place count 93 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 92 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 92 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 44 place count 89 transition count 253
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 60 place count 89 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 82 place count 89 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 82 place count 89 transition count 213
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 86 place count 87 transition count 213
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 87 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 90 place count 85 transition count 211
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 97 place count 85 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 84 transition count 210
Applied a total of 98 rules in 150 ms. Remains 84 /111 variables (removed 27) and now considering 210/235 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 84/111 places, 210/235 transitions.
RANDOM walk for 40000 steps (2751 resets) in 889 ms. (44 steps per ms) remains 16/26 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (51 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (56 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (54 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (51 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (50 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (50 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (53 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
// Phase 1: matrix 210 rows 84 cols
[2024-06-02 20:18:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:18:29] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 26/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 20/72 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 206/278 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 15/293 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/294 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/294 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/294 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 106 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 26/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 20/72 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 206/278 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 15/293 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 1/294 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/294 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/294 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 122 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2244 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
After SMT, in 3771ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 14 properties in 7609 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 206
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 81 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 81 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 79 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 16 place count 74 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 74 transition count 198
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 63 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 62 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 62 transition count 187
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 57 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 64 place count 57 transition count 216
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 69 place count 57 transition count 211
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 74 place count 52 transition count 211
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 52 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 50 transition count 211
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 81 place count 50 transition count 211
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 84 place count 47 transition count 208
Applied a total of 84 rules in 111 ms. Remains 47 /84 variables (removed 37) and now considering 208/210 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 47/84 places, 208/210 transitions.
RANDOM walk for 40000 steps (4455 resets) in 503 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (664 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (820 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1721 steps, run visited all 2 properties in 21 ms. (steps per millisecond=81 )
Probabilistic random walk after 1721 steps, saw 646 distinct states, run finished after 27 ms. (steps per millisecond=63 ) properties seen :2
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:18:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 20:18:41] [INFO ] Flatten gal took : 24 ms
FORMULA MedleyA-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:18:41] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:18:41] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 52 out of 111 places (down from 54) after GAL structural reductions.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 214
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 93 transition count 195
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 93 transition count 195
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 90 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 90 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 88 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 17 ms. Remains 88 /111 variables (removed 23) and now considering 182/235 (removed 53) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 20:18:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:18:41] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 20:18:41] [INFO ] Invariant cache hit.
[2024-06-02 20:18:41] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-06-02 20:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 20:18:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:18:43] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 20:18:45] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 20:18:49] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:18:49] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/270 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 103 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11843 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
After SMT, in 21263ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 21267ms
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21629 ms. Remains : 88/111 places, 182/235 transitions.
[2024-06-02 20:19:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:19:03] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:19:03] [INFO ] Input system was already deterministic with 182 transitions.
[2024-06-02 20:19:03] [INFO ] Flatten gal took : 30 ms
[2024-06-02 20:19:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:19:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7830046034688299233.gal : 9 ms
[2024-06-02 20:19:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6189867775907966787.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7830046034688299233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6189867775907966787.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.20005e+07,2.47954,51476,2,5742,5,149389,6,0,534,205657,0


Converting to forward existential form...Done !
original formula: EF(EX(((p72==1)&&(p87==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p72==1)&&(p87==1)))] != FALSE
(forward)formula 0,1,2.64655,51732,1,0,8,149389,8,1,1097,205657,2
FORMULA MedleyA-PT-10-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 109 transition count 223
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 99 transition count 221
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 23 place count 99 transition count 216
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 94 transition count 216
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 45 place count 82 transition count 197
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 82 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 82 transition count 196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 78 transition count 179
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 78 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 76 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 76 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 75 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 75 transition count 172
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 96 place count 62 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 62 transition count 160
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 59 transition count 155
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 59 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 59 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 107 place count 59 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 57 transition count 149
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 4 with 4 rules applied. Total rules applied 115 place count 55 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 54 transition count 146
Applied a total of 116 rules in 80 ms. Remains 54 /111 variables (removed 57) and now considering 146/235 (removed 89) transitions.
// Phase 1: matrix 146 rows 54 cols
[2024-06-02 20:19:06] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:19:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:19:06] [INFO ] Invariant cache hit.
[2024-06-02 20:19:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:19:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-02 20:19:06] [INFO ] Redundant transitions in 10 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-02 20:19:06] [INFO ] Invariant cache hit.
[2024-06-02 20:19:06] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 78 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4681 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 138/215 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/200 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 216 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 11928ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11931ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/111 places, 146/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12267 ms. Remains : 54/111 places, 146/235 transitions.
[2024-06-02 20:19:18] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:19:18] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:19:18] [INFO ] Input system was already deterministic with 146 transitions.
[2024-06-02 20:19:18] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:19:18] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:19:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9908706429540418420.gal : 7 ms
[2024-06-02 20:19:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9234528528664180226.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9908706429540418420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9234528528664180226.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.03531e+06,0.432438,10492,2,837,5,29033,6,0,358,30777,0


Converting to forward existential form...Done !
original formula: A(!(EG((((p82==1)&&(p122==1))&&((p125==1)&&(p147==1))))) U (!(E(EF((((p82==1)&&(p122==1))&&((p125==1)&&(p147==1)))) U A((p110==1) U (((p8...221
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(E(TRUE U (((p82==1)&&(p122==1))&&((p125==1)&&(p147==1)))) U !((E(!((((p82==1)&&(p122==1))&...989
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t17, t19, t20, t23, t24, t25, t2...433
Using saturation style SCC detection
(forward)formula 0,1,20.3552,471104,1,0,1416,2.58737e+06,344,675,3884,2.52277e+06,1573
FORMULA MedleyA-PT-10-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 99 transition count 219
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 99 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 99 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 96 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 96 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 93 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 93 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 91 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 91 transition count 190
Applied a total of 42 rules in 8 ms. Remains 91 /111 variables (removed 20) and now considering 190/235 (removed 45) transitions.
// Phase 1: matrix 190 rows 91 cols
[2024-06-02 20:19:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:19:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 20:19:38] [INFO ] Invariant cache hit.
[2024-06-02 20:19:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-06-02 20:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 20:19:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:19:41] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:19:41] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/281 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 20:19:44] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 20:19:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/281 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 20:19:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 0/281 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 107 constraints, problems are : Problem set: 0 solved, 189 unsolved in 14995 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/281 variables, 91/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 296 constraints, problems are : Problem set: 0 solved, 189 unsolved in 9324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints]
After SMT, in 24520ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 24522ms
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 190/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24803 ms. Remains : 91/111 places, 190/235 transitions.
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:20:03] [INFO ] Input system was already deterministic with 190 transitions.
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:20:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17574855879932297545.gal : 6 ms
[2024-06-02 20:20:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1128290584677793092.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/CTLFireability17574855879932297545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1128290584677793092.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.39274e+07,2.46066,56928,2,6710,5,151666,6,0,554,223302,0


Converting to forward existential form...Done !
original formula: !(E(((!(A(((p34==1)||((p70==1)&&(p87==1))) U (((p82==1)&&(p98==1))&&(p103==1)))) * !(EX(((p90==1)&&(p78==1))))) + (p89==1)) U (((p75==1)&...192
=> equivalent forward existential formula: [(FwdU(Init,((!(!((E(!((((p82==1)&&(p98==1))&&(p103==1))) U (!(((p34==1)||((p70==1)&&(p87==1)))) * !((((p82==1)&...329
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t25, t26, t27, t28, t30, t31, t34, t35, t37, ...445
Detected timeout of ITS tools.
[2024-06-02 20:20:33] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:20:33] [INFO ] Applying decomposition
[2024-06-02 20:20:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6595849803455063398.txt' '-o' '/tmp/graph6595849803455063398.bin' '-w' '/tmp/graph6595849803455063398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6595849803455063398.bin' '-l' '-1' '-v' '-w' '/tmp/graph6595849803455063398.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:20:34] [INFO ] Decomposing Gal with order
[2024-06-02 20:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:20:34] [INFO ] Removed a total of 390 redundant transitions.
[2024-06-02 20:20:34] [INFO ] Flatten gal took : 110 ms
[2024-06-02 20:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 23 ms.
[2024-06-02 20:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9693437928891910149.gal : 8 ms
[2024-06-02 20:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11824844972699285227.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/CTLFireability9693437928891910149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11824844972699285227.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.39274e+07,0.24683,8520,425,170,8684,922,376,17885,119,5067,0


Converting to forward existential form...Done !
original formula: !(E(((!(A(((i1.u7.p34==1)||((i2.u2.p70==1)&&(i3.u11.p87==1))) U (((i5.u12.p82==1)&&(i4.u15.p98==1))&&(i5.u19.p103==1)))) * !(EX(((i4.u18....287
=> equivalent forward existential formula: [(FwdU(Init,((!(!((E(!((((i5.u12.p82==1)&&(i4.u15.p98==1))&&(i5.u19.p103==1))) U (!(((i1.u7.p34==1)||((i2.u2.p70...466
Reverse transition relation is NOT exact ! Due to transitions t17, t50, t75, t76, t80, t170, t171, t172, t173, i0.u4.t71, i1.t64, i1.t61, i1.t60, i1.u5.t48...640
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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.89015,195348,1,0,308375,7631,2157,885918,619,51282,391661
FORMULA MedleyA-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 217
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 96 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 96 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 95 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 95 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 94 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 94 transition count 205
Applied a total of 36 rules in 6 ms. Remains 94 /111 variables (removed 17) and now considering 205/235 (removed 30) transitions.
// Phase 1: matrix 205 rows 94 cols
[2024-06-02 20:20:42] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:20:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:20:42] [INFO ] Invariant cache hit.
[2024-06-02 20:20:42] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 20:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:20:44] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 5 ms to minimize.
[2024-06-02 20:20:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:20:44] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/299 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:20:46] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:20:48] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:20:48] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 110 constraints, problems are : Problem set: 0 solved, 204 unsolved in 11065 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/299 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 204/314 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 314 constraints, problems are : Problem set: 0 solved, 204 unsolved in 10596 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 6/6 constraints]
After SMT, in 21868ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 21871ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 205/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22124 ms. Remains : 94/111 places, 205/235 transitions.
[2024-06-02 20:21:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:21:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:21:04] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 20:21:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:21:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:21:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15564793668848764844.gal : 3 ms
[2024-06-02 20:21:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5093942337344618017.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/CTLFireability15564793668848764844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5093942337344618017.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.64794e+07,2.34029,51012,2,6010,5,139163,6,0,581,207594,0


Converting to forward existential form...Done !
original formula: EX(((p57==0) * EX(EG(((((p82==0)||(p98==0))||(p113==0))&&(((p21==0)||(p28==0))||(p42==0)))))))
=> equivalent forward existential formula: [FwdG(EY((EY(Init) * (p57==0))),((((p82==0)||(p98==0))||(p113==0))&&(((p21==0)||(p28==0))||(p42==0))))] != FALSE
Hit Full ! (commute/partial/dont) 86/45/119
(forward)formula 0,1,26.042,605416,1,0,43,2.36814e+06,20,5,4004,2.95306e+06,41
FORMULA MedleyA-PT-10-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 93 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 93 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 91 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 91 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 188
Applied a total of 46 rules in 5 ms. Remains 89 /111 variables (removed 22) and now considering 188/235 (removed 47) transitions.
// Phase 1: matrix 188 rows 89 cols
[2024-06-02 20:21:30] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:21:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:21:30] [INFO ] Invariant cache hit.
[2024-06-02 20:21:30] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-06-02 20:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:21:32] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 105 constraints, problems are : Problem set: 0 solved, 187 unsolved in 8204 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 187/292 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 20:21:45] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/277 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 293 constraints, problems are : Problem set: 0 solved, 187 unsolved in 15788 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 7/7 constraints]
After SMT, in 24175ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 24178ms
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 188/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24417 ms. Remains : 89/111 places, 188/235 transitions.
[2024-06-02 20:21:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:21:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:21:55] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 20:21:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:21:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13981199269077819546.gal : 3 ms
[2024-06-02 20:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14005953815727006607.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/CTLFireability13981199269077819546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14005953815727006607.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.22067e+07,2.24479,49536,2,4985,5,135340,6,0,544,190156,0


Converting to forward existential form...Done !
original formula: EG(A(AX((((p21==1)&&(p28==1))&&(p52==1))) U EF((((p82==1)&&(p122==1))&&((p125==1)&&(p143==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((p82==1)&&(p122==1))&&((p125==1)&&(p143==1))))) U (!(!(EX(!((((p21==1)&&(p28==1))&&...313
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...430
Detected timeout of ITS tools.
[2024-06-02 20:22:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:22:25] [INFO ] Applying decomposition
[2024-06-02 20:22:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10515355013103840346.txt' '-o' '/tmp/graph10515355013103840346.bin' '-w' '/tmp/graph10515355013103840346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10515355013103840346.bin' '-l' '-1' '-v' '-w' '/tmp/graph10515355013103840346.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:22:25] [INFO ] Decomposing Gal with order
[2024-06-02 20:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:22:25] [INFO ] Removed a total of 393 redundant transitions.
[2024-06-02 20:22:25] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 9 ms.
[2024-06-02 20:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6952448274484971866.gal : 3 ms
[2024-06-02 20:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6749859511428460101.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/CTLFireability6952448274484971866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6749859511428460101.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.22067e+07,0.185709,9060,423,193,9928,1229,373,18978,110,8406,0


Converting to forward existential form...Done !
original formula: EG(A(AX((((i3.u1.p21==1)&&(i2.u5.p28==1))&&(i3.u9.p52==1))) U EF((((i6.u11.p82==1)&&(i6.u18.p122==1))&&((i7.i1.u20.p125==1)&&(i7.i1.u20.p...167
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((i6.u11.p82==1)&&(i6.u18.p122==1))&&((i7.i1.u20.p125==1)&&(i7.i1.u20.p143==1))))) U...433
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t46, t74, t78, t174, t175, t176, t177, i1.u4.t70, i2.t63, i2.t60, i2.t59, i2.u5.t44,...600
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,9.30409,256624,1,0,402381,12678,2250,1.14326e+06,593,147195,421967
FORMULA MedleyA-PT-10-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 92 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 87 transition count 181
Applied a total of 50 rules in 5 ms. Remains 87 /111 variables (removed 24) and now considering 181/235 (removed 54) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 20:22:34] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:22:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 20:22:34] [INFO ] Invariant cache hit.
[2024-06-02 20:22:35] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-06-02 20:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:22:37] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:22:37] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:22:39] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 100 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8521 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
After SMT, in 16529ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 16533ms
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 181/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16931 ms. Remains : 87/111 places, 181/235 transitions.
[2024-06-02 20:22:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:22:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:22:51] [INFO ] Input system was already deterministic with 181 transitions.
[2024-06-02 20:22:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:22:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:22:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16904288698760435891.gal : 5 ms
[2024-06-02 20:22:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4124061808996646244.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/CTLFireability16904288698760435891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4124061808996646244.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.07361e+07,1.58576,35896,2,4440,5,104342,6,0,529,133789,0


Converting to forward existential form...Done !
original formula: EX(AX(AX(AG(((p76==0)||(p87==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(EX(!(!(E(TRUE U !(((p76==0)||(p87==0))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...367
(forward)formula 0,0,6.68914,128484,1,0,361,666032,384,135,5326,504732,437
FORMULA MedleyA-PT-10-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 99 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 99 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 99 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 96 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 96 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 93 transition count 194
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 93 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 92 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 92 transition count 191
Applied a total of 39 rules in 5 ms. Remains 92 /111 variables (removed 19) and now considering 191/235 (removed 44) transitions.
// Phase 1: matrix 191 rows 92 cols
[2024-06-02 20:22:58] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:22:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:22:58] [INFO ] Invariant cache hit.
[2024-06-02 20:22:58] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-06-02 20:22:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:23:00] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:23:01] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/283 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:23:02] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:23:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 106 constraints, problems are : Problem set: 0 solved, 190 unsolved in 10914 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/283 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 190/296 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 296 constraints, problems are : Problem set: 0 solved, 190 unsolved in 9253 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 20403ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 20405ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 191/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20600 ms. Remains : 92/111 places, 191/235 transitions.
[2024-06-02 20:23:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:23:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:23:19] [INFO ] Input system was already deterministic with 191 transitions.
[2024-06-02 20:23:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:23:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14534354686051893289.gal : 3 ms
[2024-06-02 20:23:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2044828913279614001.ctl : 16 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/CTLFireability14534354686051893289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2044828913279614001.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.44418e+07,2.20989,53108,2,6156,5,150451,6,0,559,200828,0


Converting to forward existential form...Done !
original formula: (EF(((p73==1) + ((!(E(((p70==1)&&(p87==1)) U (((p21==1)&&(p35==1))&&((p82==1)&&(p122==1))))) * (((((p142==0)||(p144==0))||((p21==0)||(p32...347
=> equivalent forward existential formula: ([FwdG(EY(EY((Init * !(E(TRUE U ((p73==1) + ((!(E(((p70==1)&&(p87==1)) U (((p21==1)&&(p35==1))&&((p82==1)&&(p122...691
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t23, t25, t26, t27, t28, t29, t30, t31, ...437
Detected timeout of ITS tools.
[2024-06-02 20:23:49] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:23:49] [INFO ] Applying decomposition
[2024-06-02 20:23:49] [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/graph5794777116764993043.txt' '-o' '/tmp/graph5794777116764993043.bin' '-w' '/tmp/graph5794777116764993043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5794777116764993043.bin' '-l' '-1' '-v' '-w' '/tmp/graph5794777116764993043.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:23:49] [INFO ] Decomposing Gal with order
[2024-06-02 20:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:23:49] [INFO ] Removed a total of 375 redundant transitions.
[2024-06-02 20:23:49] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:23:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 8 ms.
[2024-06-02 20:23:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5900185413890188492.gal : 3 ms
[2024-06-02 20:23:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11233427578342782063.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/CTLFireability5900185413890188492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11233427578342782063.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.44418e+07,0.184249,9332,448,211,10141,1187,375,19454,127,6919,0


Converting to forward existential form...Done !
original formula: (EF(((i4.u12.p73==1) + ((!(E(((i6.u11.p70==1)&&(i4.u14.p87==1)) U (((i3.u2.p21==1)&&(i2.u8.p35==1))&&((i6.u11.p82==1)&&(i6.u19.p122==1)))...527
=> equivalent forward existential formula: ([FwdG(EY(EY((Init * !(E(TRUE U ((i4.u12.p73==1) + ((!(E(((i6.u11.p70==1)&&(i4.u14.p87==1)) U (((i3.u2.p21==1)&&...1012
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t55, t80, t81, t85, i1.u4.t76, i2.t70, i2.t66, i2.t65, i2.u5.t53, i2.u5.t74, i2.u5.t...709
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,9.77723,241040,1,0,347331,17565,2274,1.07832e+06,658,135657,406574
FORMULA MedleyA-PT-10-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 109 transition count 227
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 103 transition count 226
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 103 transition count 222
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 99 transition count 222
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 34 place count 87 transition count 207
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 87 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 87 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 85 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 85 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 84 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 84 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 83 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 83 transition count 192
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 74 place count 73 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 73 transition count 182
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 78 place count 70 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 81 place count 70 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 86 place count 70 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 86 place count 70 transition count 169
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 67 transition count 169
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 4 with 4 rules applied. Total rules applied 96 place count 65 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 63 transition count 165
Applied a total of 98 rules in 40 ms. Remains 63 /111 variables (removed 48) and now considering 165/235 (removed 70) transitions.
// Phase 1: matrix 165 rows 63 cols
[2024-06-02 20:23:59] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:23:59] [INFO ] Implicit Places using invariants in 68 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/111 places, 165/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 115 ms. Remains : 62/111 places, 165/235 transitions.
[2024-06-02 20:23:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:59] [INFO ] Input system was already deterministic with 165 transitions.
[2024-06-02 20:23:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:23:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:23:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8133298009595345545.gal : 2 ms
[2024-06-02 20:23:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7445858495873406327.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/CTLFireability8133298009595345545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7445858495873406327.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.79406e+06,0.519292,16240,2,2154,5,45821,6,0,411,49856,0


Converting to forward existential form...Done !
original formula: EF(((AF((p46!=1)) + (((p134!=1)&&(p27!=1))&&(((p82!=1)||(p98!=1))||(p103!=1)))) * (AG(((((p21==1)&&(p25==1))&&((p82==1)&&(p96==1)))||(((p...295
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EG(!((p46!=1)))) + (((p134!=1)&&(p27!=1))&&(((p82!=1)||(p98!=1))||(p103!=1))))) * !(E(T...613
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t10, t11, t12, t13, t15, t16, t21, t22, t23, t24, t25, t27, t28, t30,...412
Detected timeout of ITS tools.
[2024-06-02 20:24:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:29] [INFO ] Applying decomposition
[2024-06-02 20:24:29] [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/graph3623982825264665534.txt' '-o' '/tmp/graph3623982825264665534.bin' '-w' '/tmp/graph3623982825264665534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3623982825264665534.bin' '-l' '-1' '-v' '-w' '/tmp/graph3623982825264665534.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:24:29] [INFO ] Decomposing Gal with order
[2024-06-02 20:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:24:29] [INFO ] Removed a total of 387 redundant transitions.
[2024-06-02 20:24:29] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2024-06-02 20:24:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9595024007226773519.gal : 11 ms
[2024-06-02 20:24:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4818088826862931108.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/CTLFireability9595024007226773519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4818088826862931108.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.79406e+06,0.079523,5708,243,106,4019,532,248,7534,104,2062,0


Converting to forward existential form...Done !
original formula: EF(((AF((i2.u7.p46!=1)) + (((i5.u13.p134!=1)&&(u2.p27!=1))&&(((i3.u8.p82!=1)||(i4.u9.p98!=1))||(i3.u12.p103!=1)))) * (AG(((((i1.u0.p21==1...424
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EG(!((i2.u7.p46!=1)))) + (((i5.u13.p134!=1)&&(u2.p27!=1))&&(((i3.u8.p82!=1)||(i4.u9.p98...827
Reverse transition relation is NOT exact ! Due to transitions t23, t93, t98, t157, i1.t36, i1.u3.t21, i1.u4.t148, i2.t33, i2.t32, i2.u6.t118, i2.u6.t119, i...505
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,3.2789,95468,1,0,136881,4816,1494,355908,516,19096,165494
FORMULA MedleyA-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 109 transition count 221
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 97 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 96 transition count 219
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 96 transition count 217
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 32 place count 94 transition count 217
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 42 place count 84 transition count 202
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 84 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 84 transition count 201
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 54 place count 83 transition count 201
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 80 place count 69 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 69 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 67 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 67 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 91 place count 67 transition count 180
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 91 place count 67 transition count 177
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 97 place count 64 transition count 177
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 4 with 4 rules applied. Total rules applied 101 place count 62 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 60 transition count 173
Applied a total of 103 rules in 51 ms. Remains 60 /111 variables (removed 51) and now considering 173/235 (removed 62) transitions.
// Phase 1: matrix 173 rows 60 cols
[2024-06-02 20:24:33] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:24:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:24:33] [INFO ] Invariant cache hit.
[2024-06-02 20:24:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:24:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 20:24:33] [INFO ] Redundant transitions in 6 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-02 20:24:33] [INFO ] Invariant cache hit.
[2024-06-02 20:24:33] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 173/232 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 1/233 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 84 constraints, problems are : Problem set: 0 solved, 165 unsolved in 7655 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 173/232 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 164/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 1/233 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 0/233 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 249 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 18223ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 18225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/111 places, 173/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18513 ms. Remains : 60/111 places, 173/235 transitions.
[2024-06-02 20:24:51] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:24:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:24:51] [INFO ] Input system was already deterministic with 173 transitions.
[2024-06-02 20:24:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:24:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:24:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16459707377439783579.gal : 3 ms
[2024-06-02 20:24:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6611663276783452229.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/CTLFireability16459707377439783579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6611663276783452229.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.25831e+06,0.837751,16788,2,1822,5,45081,6,0,409,50906,0


Converting to forward existential form...Done !
original formula: A((p107==1) U A((p106!=1) U EF((EG((p51==1)) + (((p140==1)&&(p21==1))&&((p37==1)&&(p47==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U (EG((p51==1)) + (((p140==1)&&(p21==1))&&((p37==1)&&(p47==1)))))) U (!((p106!=1)...890
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t13, t14, t15, t16, t17, t19, t21, t22, t23, t24, t...442
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 20:25:21] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:25:21] [INFO ] Applying decomposition
[2024-06-02 20:25:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15543039875605173369.txt' '-o' '/tmp/graph15543039875605173369.bin' '-w' '/tmp/graph15543039875605173369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15543039875605173369.bin' '-l' '-1' '-v' '-w' '/tmp/graph15543039875605173369.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:25:21] [INFO ] Decomposing Gal with order
[2024-06-02 20:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:25:21] [INFO ] Removed a total of 331 redundant transitions.
[2024-06-02 20:25:21] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:25:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 5 ms.
[2024-06-02 20:25:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6251035594770186803.gal : 2 ms
[2024-06-02 20:25:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12494875960753301036.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/CTLFireability6251035594770186803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12494875960753301036.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.25831e+06,0.152471,6216,152,203,4262,1206,188,9001,156,7853,0


Converting to forward existential form...Done !
original formula: A((u6.p107==1) U A((u6.p106!=1) U EF((EG((u3.p51==1)) + (((i4.u7.p140==1)&&(i1.u0.p21==1))&&((i1.u2.p37==1)&&(u3.p47==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U (EG((u3.p51==1)) + (((i4.u7.p140==1)&&(i1.u0.p21==1))&&((i1.u2.p37==1)&&(u3.p47...1118
Reverse transition relation is NOT exact ! Due to transitions t61, t88, t165, u3.t22, u3.t23, u3.t24, u3.t26, u3.t27, u3.t29, u3.t30, u3.t31, u3.t33, u3.t3...497
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
(forward)formula 0,1,4.39999,108648,1,0,146931,17804,1121,411987,766,101106,138107
FORMULA MedleyA-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 92 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 87 transition count 181
Applied a total of 50 rules in 5 ms. Remains 87 /111 variables (removed 24) and now considering 181/235 (removed 54) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 20:25:26] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:25:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:25:26] [INFO ] Invariant cache hit.
[2024-06-02 20:25:26] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-06-02 20:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:25:28] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:25:28] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:25:30] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 100 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7976 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 180 unsolved in 10153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
After SMT, in 18397ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 18402ms
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 181/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18660 ms. Remains : 87/111 places, 181/235 transitions.
[2024-06-02 20:25:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:25:44] [INFO ] Flatten gal took : 5 ms
FORMULA MedleyA-PT-10-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:25:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:25:44] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 98 transition count 215
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 98 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 96 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 96 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 95 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 95 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 94 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 94 transition count 200
Applied a total of 35 rules in 5 ms. Remains 94 /111 variables (removed 17) and now considering 200/235 (removed 35) transitions.
// Phase 1: matrix 200 rows 94 cols
[2024-06-02 20:25:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:25:45] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:25:45] [INFO ] Invariant cache hit.
[2024-06-02 20:25:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-06-02 20:25:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 4 ms to minimize.
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/294 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 20:25:50] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 107 constraints, problems are : Problem set: 0 solved, 199 unsolved in 11058 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/294 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 199/306 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 306 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13464 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 3/3 constraints]
After SMT, in 24705ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 24707ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 200/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25006 ms. Remains : 94/111 places, 200/235 transitions.
[2024-06-02 20:26:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:09] [INFO ] Input system was already deterministic with 200 transitions.
[2024-06-02 20:26:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16442334107379469156.gal : 2 ms
[2024-06-02 20:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9894659909576360020.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/CTLFireability16442334107379469156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9894659909576360020.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.80933e+07,2.03097,50020,2,6636,5,142756,6,0,576,195725,0


Converting to forward existential form...Done !
original formula: AG((((!(E((((p21==1)&&(p35==1))&&((p75==1)&&(p86==1))) U (((p82==1)&&(p89==1))&&(p108==1)))) + AX(FALSE)) + ((p116==1)||(p43==0))) + ((p8...248
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((p81==1)||((((p21==1)&&(p35==1))&&((p75==1)&&(p122==1)))&&(((p25==1)&&(p125==1))&&(...311
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t27, t29, t30, t31, t32, ...500
(forward)formula 0,0,5.73693,113560,1,0,371,538634,424,127,5778,448618,414
FORMULA MedleyA-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 92 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 87 transition count 181
Applied a total of 50 rules in 7 ms. Remains 87 /111 variables (removed 24) and now considering 181/235 (removed 54) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 20:26:15] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 20:26:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:26:15] [INFO ] Invariant cache hit.
[2024-06-02 20:26:16] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-06-02 20:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:26:17] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:26:17] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 20:26:19] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 100 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8299 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
After SMT, in 16838ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 16842ms
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 181/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17085 ms. Remains : 87/111 places, 181/235 transitions.
[2024-06-02 20:26:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:26:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:26:32] [INFO ] Input system was already deterministic with 181 transitions.
[2024-06-02 20:26:32] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:26:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:26:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6643139164793899710.gal : 3 ms
[2024-06-02 20:26:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10883969730533919451.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/CTLFireability6643139164793899710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10883969730533919451.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.07361e+07,1.33453,35804,2,4440,5,104342,6,0,529,133789,0


Converting to forward existential form...Done !
original formula: EF((EG(AF((p31==0))) * EX((((p21==1)&&(p61==1))&&((p125==1)&&(p141==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(!(EG(!((p31==0))))))) * (((p21==1)&&(p61==1))&&((p125==1)&&(p141==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...367
Detected timeout of ITS tools.
[2024-06-02 20:27:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:27:02] [INFO ] Applying decomposition
[2024-06-02 20:27:02] [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/graph9871929572118774069.txt' '-o' '/tmp/graph9871929572118774069.bin' '-w' '/tmp/graph9871929572118774069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9871929572118774069.bin' '-l' '-1' '-v' '-w' '/tmp/graph9871929572118774069.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:27:03] [INFO ] Decomposing Gal with order
[2024-06-02 20:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:27:03] [INFO ] Removed a total of 383 redundant transitions.
[2024-06-02 20:27:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2024-06-02 20:27:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15676341680533481617.gal : 2 ms
[2024-06-02 20:27:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11416526037024093962.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/CTLFireability15676341680533481617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11416526037024093962.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.07361e+07,0.191074,9548,505,107,10243,611,367,23408,89,1852,0


Converting to forward existential form...Done !
original formula: EF((EG(AF((i1.u7.p31==0))) * EX((((i2.u2.p21==1)&&(i2.u11.p61==1))&&((i3.u22.p125==1)&&(i3.u26.p141==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(!(EG(!((i1.u7.p31==0))))))) * (((i2.u2.p21==1)&&(i2.u11.p61==1))&&((i3.u22.p125==1)&&...184
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t46, t75, t119, i0.u5.t67, i1.t60, i1.t57, i1.t56, i1.u6.t44, i1.u6.t65, i1.u6.t66, ...523
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,9.21321,241300,1,0,378935,7911,2015,1.13458e+06,447,67661,358565
FORMULA MedleyA-PT-10-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 235/235 transitions.
Graph (complete) has 441 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 222
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 98 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 98 transition count 218
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 30 place count 95 transition count 218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 40 place count 85 transition count 205
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 85 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 85 transition count 204
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 83 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 83 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 81 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 81 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 80 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 80 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 68 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 68 transition count 176
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 66 transition count 174
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 66 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 93 place count 66 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 93 place count 66 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 63 transition count 166
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 4 with 4 rules applied. Total rules applied 103 place count 61 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 60 transition count 163
Applied a total of 104 rules in 36 ms. Remains 60 /111 variables (removed 51) and now considering 163/235 (removed 72) transitions.
// Phase 1: matrix 163 rows 60 cols
[2024-06-02 20:27:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:27:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:27:12] [INFO ] Invariant cache hit.
[2024-06-02 20:27:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:27:12] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-02 20:27:12] [INFO ] Redundant transitions in 5 ms returned []
Running 154 sub problems to find dead transitions.
[2024-06-02 20:27:12] [INFO ] Invariant cache hit.
[2024-06-02 20:27:12] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 163/222 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/223 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-02 20:27:18] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/223 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 85 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8056 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 163/222 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 154/238 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 1/223 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 239 constraints, problems are : Problem set: 0 solved, 154 unsolved in 12598 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 1/1 constraints]
After SMT, in 20950ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 20953ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/111 places, 163/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21233 ms. Remains : 60/111 places, 163/235 transitions.
[2024-06-02 20:27:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:27:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:27:33] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-02 20:27:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10993656710577512193.gal : 2 ms
[2024-06-02 20:27:33] [INFO ] Time to serialize properties into /tmp/CTLFireability502806007343492830.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/CTLFireability10993656710577512193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability502806007343492830.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.95977e+06,0.540396,14140,2,1864,5,40007,6,0,400,32990,0


Converting to forward existential form...Done !
original formula: EG((EF((E((((p82==1)&&(p98==1))&&(p103==1)) U ((p66==1)&&(p87==1))) + AF((((p21==1)&&(p61==1))&&((p125==1)&&(p141==1)))))) * (p107==0)))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((((p82==1)&&(p98==1))&&(p103==1)) U ((p66==1)&&(p87==1))) + !(EG(!((((p21==1)&&(p61==1))...209
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t9, t11, t12, t14, t15, t16, t17, t19, t20, t23, t24, t25, t26, t29, ...493
Detected timeout of ITS tools.
[2024-06-02 20:28:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:03] [INFO ] Applying decomposition
[2024-06-02 20:28:03] [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/graph10414117541497156666.txt' '-o' '/tmp/graph10414117541497156666.bin' '-w' '/tmp/graph10414117541497156666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10414117541497156666.bin' '-l' '-1' '-v' '-w' '/tmp/graph10414117541497156666.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:28:03] [INFO ] Decomposing Gal with order
[2024-06-02 20:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:28:03] [INFO ] Removed a total of 327 redundant transitions.
[2024-06-02 20:28:03] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2024-06-02 20:28:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17873075137843035920.gal : 1 ms
[2024-06-02 20:28:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16222697976449602850.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/CTLFireability17873075137843035920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16222697976449602850.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.95977e+06,0.089174,6236,208,137,4867,769,221,10687,139,3252,0


Converting to forward existential form...Done !
original formula: EG((EF((E((((i2.u5.p82==1)&&(i2.u8.p98==1))&&(u9.p103==1)) U ((i2.u8.p66==1)&&(i4.u6.p87==1))) + AF((((i0.u0.p21==1)&&(i0.u0.p61==1))&&((...210
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((((i2.u5.p82==1)&&(i2.u8.p98==1))&&(u9.p103==1)) U ((i2.u8.p66==1)&&(i4.u6.p87==1))) + !...265
Reverse transition relation is NOT exact ! Due to transitions t60, t61, t71, t104, t152, t154, t157, u9.t4, u9.t5, u9.t6, u9.t8, u9.t9, u9.t11, u9.t12, u9....506
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,5.91291,148268,1,0,208965,12974,1272,725841,673,106824,205960
FORMULA MedleyA-PT-10-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-06-02 20:28:09] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:09] [INFO ] Flatten gal took : 8 ms
Total runtime 636975 ms.

BK_STOP 1717360089754

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

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