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.r092-tall-171624189400514.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 DBSingleClientW-PT-d1m07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189400514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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 DBSingleClientW-PT-d1m07-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716320222138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:37:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:37:03] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-21 19:37:03] [INFO ] Transformed 1440 places.
[2024-05-21 19:37:03] [INFO ] Transformed 672 transitions.
[2024-05-21 19:37:03] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 93 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 162 place count 265 transition count 496
Iterating global reduction 1 with 61 rules applied. Total rules applied 223 place count 265 transition count 496
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 231 place count 265 transition count 488
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 266 place count 230 transition count 453
Iterating global reduction 2 with 35 rules applied. Total rules applied 301 place count 230 transition count 453
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 223 transition count 445
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 223 transition count 445
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 320 place count 223 transition count 440
Applied a total of 320 rules in 75 ms. Remains 223 /347 variables (removed 124) and now considering 440/672 (removed 232) transitions.
// Phase 1: matrix 440 rows 223 cols
[2024-05-21 19:37:03] [INFO ] Computed 2 invariants in 30 ms
[2024-05-21 19:37:03] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-21 19:37:03] [INFO ] Invariant cache hit.
[2024-05-21 19:37:04] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-21 19:37:04] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-21 19:37:04] [INFO ] Invariant cache hit.
[2024-05-21 19:37:04] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/223 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/663 variables, 223/225 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 238/463 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (OVERLAPS) 0/663 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 463 constraints, problems are : Problem set: 0 solved, 439 unsolved in 23879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/223 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/663 variables, 223/225 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 238/463 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 439/902 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 902 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
After SMT, in 55162ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 55187ms
Starting structural reductions in LTL mode, iteration 1 : 223/347 places, 440/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56172 ms. Remains : 223/347 places, 440/672 transitions.
Support contains 93 out of 223 places after structural reductions.
[2024-05-21 19:37:59] [INFO ] Flatten gal took : 53 ms
[2024-05-21 19:37:59] [INFO ] Flatten gal took : 27 ms
[2024-05-21 19:37:59] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 92 out of 223 places (down from 93) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 70 to 69
RANDOM walk for 40000 steps (9225 resets) in 2498 ms. (16 steps per ms) remains 57/69 properties
BEST_FIRST walk for 4002 steps (194 resets) in 85 ms. (46 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (195 resets) in 48 ms. (81 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4002 steps (180 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (212 resets) in 59 ms. (66 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (200 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (172 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (374 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (401 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (365 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (800 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (186 resets) in 56 ms. (70 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (191 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (183 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (214 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (158 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (179 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (353 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (389 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (397 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (169 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (404 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (436 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (106 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (199 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (193 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (422 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (393 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (194 resets) in 51 ms. (76 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (191 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (177 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (159 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (168 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (180 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (174 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (182 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (185 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (211 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (163 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (191 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (396 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (186 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (411 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (401 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (192 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (800 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (153 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (204 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (190 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (171 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (183 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
[2024-05-21 19:38:01] [INFO ] Invariant cache hit.
[2024-05-21 19:38:01] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/137 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/175 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 408/583 variables, 175/177 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 206/383 constraints. Problems are: Problem set: 6 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/383 constraints. Problems are: Problem set: 6 solved, 49 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 80/663 variables, 48/431 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 32/463 constraints. Problems are: Problem set: 7 solved, 48 unsolved
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/464 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/464 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/663 variables, 0/464 constraints. Problems are: Problem set: 7 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 464 constraints, problems are : Problem set: 7 solved, 48 unsolved in 4654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 223/223 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 69/127 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 40/167 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 48 unsolved
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 5/7 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 391/558 variables, 167/174 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 189/363 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 1/364 constraints. Problems are: Problem set: 7 solved, 48 unsolved
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 9/373 constraints. Problems are: Problem set: 7 solved, 48 unsolved
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 3 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 8/381 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 105/663 variables, 56/437 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 49/486 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/663 variables, 47/533 constraints. Problems are: Problem set: 7 solved, 48 unsolved
SMT process timed out in 9873ms, After SMT, problems are : Problem set: 7 solved, 48 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 209 transition count 404
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 209 transition count 404
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 209 transition count 402
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 200 transition count 391
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 200 transition count 391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 200 transition count 388
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 199 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 199 transition count 387
Applied a total of 53 rules in 56 ms. Remains 199 /223 variables (removed 24) and now considering 387/440 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 199/223 places, 387/440 transitions.
RANDOM walk for 40000 steps (9140 resets) in 506 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (196 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (201 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (202 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (167 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (376 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (403 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (384 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (800 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (190 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (205 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (180 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (191 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (156 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (197 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (405 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (367 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (369 resets) in 22 ms. (173 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (202 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (429 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (123 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (182 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (194 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (395 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (383 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (206 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (194 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (183 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (190 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (215 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (161 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (166 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (194 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (161 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (184 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (359 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (353 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (382 resets) in 22 ms. (173 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (170 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (800 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (196 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (175 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (185 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (159 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (183 resets) in 111 ms. (35 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (173 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (193 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (175 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
Finished probabilistic random walk after 112698 steps, run visited all 48 properties in 529 ms. (steps per millisecond=213 )
Probabilistic random walk after 112698 steps, saw 44034 distinct states, run finished after 533 ms. (steps per millisecond=211 ) properties seen :48
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:38:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 22 ms
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:38:12] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 52 out of 223 places (down from 60) after GAL structural reductions.
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 875 edges and 223 vertex of which 222 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 175 transition count 290
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 175 transition count 290
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 109 place count 175 transition count 277
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 146 place count 138 transition count 230
Iterating global reduction 1 with 37 rules applied. Total rules applied 183 place count 138 transition count 230
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 197 place count 138 transition count 216
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 216 place count 119 transition count 185
Iterating global reduction 2 with 19 rules applied. Total rules applied 235 place count 119 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 245 place count 119 transition count 175
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 254 place count 110 transition count 161
Iterating global reduction 3 with 9 rules applied. Total rules applied 263 place count 110 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 264 place count 110 transition count 160
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 271 place count 103 transition count 153
Iterating global reduction 4 with 7 rules applied. Total rules applied 278 place count 103 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 280 place count 103 transition count 151
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 283 place count 100 transition count 148
Iterating global reduction 5 with 3 rules applied. Total rules applied 286 place count 100 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 288 place count 100 transition count 146
Applied a total of 288 rules in 37 ms. Remains 100 /223 variables (removed 123) and now considering 146/440 (removed 294) transitions.
// Phase 1: matrix 146 rows 100 cols
[2024-05-21 19:38:12] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:38:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:38:12] [INFO ] Invariant cache hit.
[2024-05-21 19:38:12] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 19:38:12] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-21 19:38:12] [INFO ] Redundant transitions in 3 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-21 19:38:12] [INFO ] Invariant cache hit.
[2024-05-21 19:38:12] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/246 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 62/164 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 164 constraints, problems are : Problem set: 0 solved, 145 unsolved in 3049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/246 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 62/164 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 145/309 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 309 constraints, problems are : Problem set: 0 solved, 145 unsolved in 6778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
After SMT, in 10012ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 10014ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/223 places, 146/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10283 ms. Remains : 100/223 places, 146/440 transitions.
[2024-05-21 19:38:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:38:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:38:22] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:38:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:38:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2166321048131636553.gal : 4 ms
[2024-05-21 19:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11217607852494365253.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/CTLFireability2166321048131636553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11217607852494365253.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,5.75494e+06,11.2566,290892,2,30470,5,979769,6,0,546,751475,0


Converting to forward existential form...Done !
original formula: (EF(!(E(!(((s1>=1)&&(l610>=1))) U (!(AF(((s1>=1)&&(l606>=1)))) * E(((s1>=1)&&(l1215>=1)) U ((s1>=1)&&(l1024>=1))))))) * E((EF(((p28>=1)&&...221
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U !(E(!(((s1>=1)&&(l610>=1))) U (!(!(EG(!(((s1>=1)&&(l606>=1)))))) * E(((s1>=1)&&(l121...289
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t41, t42, t43, t44, t45, t46, t47, t48, t50, t51, t52, t53, t54, t...566
Detected timeout of ITS tools.
[2024-05-21 19:38:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:38:53] [INFO ] Applying decomposition
[2024-05-21 19:38:53] [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/graph1550901744079205153.txt' '-o' '/tmp/graph1550901744079205153.bin' '-w' '/tmp/graph1550901744079205153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1550901744079205153.bin' '-l' '-1' '-v' '-w' '/tmp/graph1550901744079205153.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:38:53] [INFO ] Decomposing Gal with order
[2024-05-21 19:38:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:38:53] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-21 19:38:53] [INFO ] Flatten gal took : 40 ms
[2024-05-21 19:38:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 9 ms.
[2024-05-21 19:38:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9994216403420493224.gal : 5 ms
[2024-05-21 19:38:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13498862247848859158.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/CTLFireability9994216403420493224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13498862247848859158.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 170 transition count 263
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 170 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 170 transition count 256
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 153 place count 130 transition count 206
Iterating global reduction 1 with 40 rules applied. Total rules applied 193 place count 130 transition count 206
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 207 place count 130 transition count 192
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 229 place count 108 transition count 156
Iterating global reduction 2 with 22 rules applied. Total rules applied 251 place count 108 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 260 place count 108 transition count 147
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 271 place count 97 transition count 129
Iterating global reduction 3 with 11 rules applied. Total rules applied 282 place count 97 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 285 place count 97 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 292 place count 90 transition count 119
Iterating global reduction 4 with 7 rules applied. Total rules applied 299 place count 90 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 90 transition count 116
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 306 place count 86 transition count 107
Iterating global reduction 5 with 4 rules applied. Total rules applied 310 place count 86 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 312 place count 86 transition count 105
Applied a total of 312 rules in 39 ms. Remains 86 /223 variables (removed 137) and now considering 105/440 (removed 335) transitions.
// Phase 1: matrix 105 rows 86 cols
[2024-05-21 19:39:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:39:23] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 19:39:23] [INFO ] Invariant cache hit.
[2024-05-21 19:39:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:39:23] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-21 19:39:23] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-21 19:39:23] [INFO ] Invariant cache hit.
[2024-05-21 19:39:23] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/191 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/191 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 104/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 225 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 5113ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5115ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/223 places, 105/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5533 ms. Remains : 86/223 places, 105/440 transitions.
[2024-05-21 19:39:28] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:39:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:39:28] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-21 19:39:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13440047781467054378.gal : 6 ms
[2024-05-21 19:39:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10817854081671986757.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/CTLFireability13440047781467054378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10817854081671986757.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2483e+06,4.06832,116832,2,17292,5,367218,6,0,449,428436,0


Converting to forward existential form...Done !
original formula: EF(AG(((p50<1)||(l0<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p50<1)||(l0<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t46, t48, t49, t50, t66, t73, t74, t75, t76, t77, t78, t79, t80, t...378
(forward)formula 0,1,9.53231,217932,1,0,231,994526,232,97,3101,614637,258
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 171 transition count 265
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 171 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 171 transition count 259
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 150 place count 131 transition count 209
Iterating global reduction 1 with 40 rules applied. Total rules applied 190 place count 131 transition count 209
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 204 place count 131 transition count 195
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 226 place count 109 transition count 159
Iterating global reduction 2 with 22 rules applied. Total rules applied 248 place count 109 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 257 place count 109 transition count 150
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 269 place count 97 transition count 131
Iterating global reduction 3 with 12 rules applied. Total rules applied 281 place count 97 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 97 transition count 128
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 292 place count 89 transition count 120
Iterating global reduction 4 with 8 rules applied. Total rules applied 300 place count 89 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 303 place count 89 transition count 117
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 307 place count 85 transition count 108
Iterating global reduction 5 with 4 rules applied. Total rules applied 311 place count 85 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 313 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 314 place count 84 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 84 transition count 104
Applied a total of 315 rules in 26 ms. Remains 84 /223 variables (removed 139) and now considering 104/440 (removed 336) transitions.
// Phase 1: matrix 104 rows 84 cols
[2024-05-21 19:39:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:39:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 19:39:38] [INFO ] Invariant cache hit.
[2024-05-21 19:39:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:39:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 19:39:38] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-21 19:39:38] [INFO ] Invariant cache hit.
[2024-05-21 19:39:38] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 120 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 103/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 223 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5870ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5871ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/223 places, 104/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6207 ms. Remains : 84/223 places, 104/440 transitions.
[2024-05-21 19:39:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:39:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:44] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-21 19:39:44] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:39:44] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:39:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12327934957119650812.gal : 1 ms
[2024-05-21 19:39:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12089463858675401124.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/CTLFireability12327934957119650812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12089463858675401124.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26939e+06,3.13739,97472,2,15629,5,309850,6,0,440,321347,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(((s2<1)||(l1258<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((s2<1)||(l1258<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t64, t72, t73, t74, t75, t76, t77, t78, t79, t80, t...372
(forward)formula 0,1,20.5041,559068,1,0,301,2.9845e+06,235,133,3075,2.12528e+06,380
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 170 transition count 263
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 170 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 170 transition count 256
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 152 place count 131 transition count 209
Iterating global reduction 1 with 39 rules applied. Total rules applied 191 place count 131 transition count 209
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 205 place count 131 transition count 195
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 224 place count 112 transition count 163
Iterating global reduction 2 with 19 rules applied. Total rules applied 243 place count 112 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 252 place count 112 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 261 place count 103 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 270 place count 103 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 271 place count 103 transition count 139
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 278 place count 96 transition count 132
Iterating global reduction 4 with 7 rules applied. Total rules applied 285 place count 96 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 288 place count 96 transition count 129
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 292 place count 92 transition count 120
Iterating global reduction 5 with 4 rules applied. Total rules applied 296 place count 92 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 298 place count 92 transition count 118
Applied a total of 298 rules in 18 ms. Remains 92 /223 variables (removed 131) and now considering 118/440 (removed 322) transitions.
// Phase 1: matrix 118 rows 92 cols
[2024-05-21 19:40:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:40:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:40:05] [INFO ] Invariant cache hit.
[2024-05-21 19:40:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:40:05] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 19:40:05] [INFO ] Redundant transitions in 3 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 19:40:05] [INFO ] Invariant cache hit.
[2024-05-21 19:40:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/210 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 40/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/210 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 40/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 6492ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6495ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/223 places, 118/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6813 ms. Remains : 92/223 places, 118/440 transitions.
[2024-05-21 19:40:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:40:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:40:12] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-21 19:40:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:40:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:40:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9544496994434708301.gal : 1 ms
[2024-05-21 19:40:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9602380010812352465.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/CTLFireability9544496994434708301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9602380010812352465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85828e+06,5.02187,149360,2,19367,5,465602,6,0,486,448270,0


Converting to forward existential form...Done !
original formula: EF(((EF(((((s1>=1)&&(l3>=1))||((s1>=1)&&(l1026>=1)))||((s1>=1)&&(l1023>=1)))) * (s1>=1)) * (l445>=1)))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (l445>=1)) * (s1>=1)),TRUE) * ((((s1>=1)&&(l3>=1))||((s1>=1)&&(l1026>=1)))||((s1>=1)&...179
(forward)formula 0,1,6.67908,149360,1,0,12,465602,11,3,920,448270,5
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 179 transition count 291
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 179 transition count 291
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 179 transition count 282
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 130 place count 146 transition count 240
Iterating global reduction 1 with 33 rules applied. Total rules applied 163 place count 146 transition count 240
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 174 place count 146 transition count 229
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 129 transition count 203
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 129 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 215 place count 129 transition count 196
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 223 place count 121 transition count 185
Iterating global reduction 3 with 8 rules applied. Total rules applied 231 place count 121 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 236 place count 121 transition count 180
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 240 place count 117 transition count 176
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 117 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 117 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 116 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 116 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 115 transition count 172
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 115 transition count 172
Applied a total of 249 rules in 19 ms. Remains 115 /223 variables (removed 108) and now considering 172/440 (removed 268) transitions.
// Phase 1: matrix 172 rows 115 cols
[2024-05-21 19:40:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:40:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 19:40:19] [INFO ] Invariant cache hit.
[2024-05-21 19:40:19] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 19:40:19] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-21 19:40:19] [INFO ] Redundant transitions in 8 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-21 19:40:19] [INFO ] Invariant cache hit.
[2024-05-21 19:40:19] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/287 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 183 constraints, problems are : Problem set: 0 solved, 171 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/287 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 171/354 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 354 constraints, problems are : Problem set: 0 solved, 171 unsolved in 13006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 17179ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 17182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/223 places, 172/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17486 ms. Remains : 115/223 places, 172/440 transitions.
[2024-05-21 19:40:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:40:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:40:36] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-21 19:40:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9042870161508197244.gal : 2 ms
[2024-05-21 19:40:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13434476919004989863.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/CTLFireability9042870161508197244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13434476919004989863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 19:41:06] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:06] [INFO ] Applying decomposition
[2024-05-21 19:41:06] [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/graph2327194583355708443.txt' '-o' '/tmp/graph2327194583355708443.bin' '-w' '/tmp/graph2327194583355708443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2327194583355708443.bin' '-l' '-1' '-v' '-w' '/tmp/graph2327194583355708443.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:41:06] [INFO ] Decomposing Gal with order
[2024-05-21 19:41:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:41:06] [INFO ] Removed a total of 179 redundant transitions.
[2024-05-21 19:41:06] [INFO ] Flatten gal took : 21 ms
[2024-05-21 19:41:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 5 ms.
[2024-05-21 19:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4830584243301658332.gal : 3 ms
[2024-05-21 19:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9710833062465407746.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/CTLFireability4830584243301658332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9710833062465407746.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 175 transition count 289
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 175 transition count 289
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 105 place count 175 transition count 280
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 144 place count 136 transition count 231
Iterating global reduction 1 with 39 rules applied. Total rules applied 183 place count 136 transition count 231
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 199 place count 136 transition count 215
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 219 place count 116 transition count 184
Iterating global reduction 2 with 20 rules applied. Total rules applied 239 place count 116 transition count 184
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 249 place count 116 transition count 174
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 259 place count 106 transition count 158
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 106 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 106 transition count 156
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 278 place count 99 transition count 149
Iterating global reduction 4 with 7 rules applied. Total rules applied 285 place count 99 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 99 transition count 148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 290 place count 95 transition count 139
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 95 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 296 place count 95 transition count 137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 297 place count 94 transition count 135
Iterating global reduction 6 with 1 rules applied. Total rules applied 298 place count 94 transition count 135
Applied a total of 298 rules in 25 ms. Remains 94 /223 variables (removed 129) and now considering 135/440 (removed 305) transitions.
// Phase 1: matrix 135 rows 94 cols
[2024-05-21 19:41:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:41:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:41:36] [INFO ] Invariant cache hit.
[2024-05-21 19:41:36] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 19:41:37] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 19:41:37] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 19:41:37] [INFO ] Invariant cache hit.
[2024-05-21 19:41:37] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/229 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 150 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/229 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 134/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 284 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 8761ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/223 places, 135/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9014 ms. Remains : 94/223 places, 135/440 transitions.
[2024-05-21 19:41:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:41:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:41:45] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-21 19:41:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:41:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17655919838556144677.gal : 2 ms
[2024-05-21 19:41:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3532620627412061412.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/CTLFireability17655919838556144677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3532620627412061412.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.27033e+06,11.9538,305920,2,26268,5,988458,6,0,511,1.01077e+06,0


Converting to forward existential form...Done !
original formula: E(EG((!(AG(((p124>=1)&&(l532>=1)))) * (!(E(((s1>=1)&&(l606>=1)) U ((s1>=1)&&(l1024>=1)))) + ((s1>=1)&&(l1256>=1))))) U ((s1>=1)&&(l36>=1)...157
=> equivalent forward existential formula: [(FwdU(Init,EG((!(!(E(TRUE U !(((p124>=1)&&(l532>=1)))))) * (!(E(((s1>=1)&&(l606>=1)) U ((s1>=1)&&(l1024>=1)))) ...215
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t39, t40, t41, t42, t43, t44, t45, t51, t52, t53, t64,...545
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:42:15] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:42:15] [INFO ] Applying decomposition
[2024-05-21 19:42:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13485002413757482860.txt' '-o' '/tmp/graph13485002413757482860.bin' '-w' '/tmp/graph13485002413757482860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13485002413757482860.bin' '-l' '-1' '-v' '-w' '/tmp/graph13485002413757482860.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:42:15] [INFO ] Decomposing Gal with order
[2024-05-21 19:42:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:42:15] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-21 19:42:15] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:42:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 4 ms.
[2024-05-21 19:42:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16733315498611372814.gal : 2 ms
[2024-05-21 19:42:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4516591651567457338.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/CTLFireability16733315498611372814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4516591651567457338.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 173 transition count 270
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 173 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 107 place count 173 transition count 263
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 144 place count 136 transition count 216
Iterating global reduction 1 with 37 rules applied. Total rules applied 181 place count 136 transition count 216
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 195 place count 136 transition count 202
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 214 place count 117 transition count 170
Iterating global reduction 2 with 19 rules applied. Total rules applied 233 place count 117 transition count 170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 240 place count 117 transition count 163
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 250 place count 107 transition count 150
Iterating global reduction 3 with 10 rules applied. Total rules applied 260 place count 107 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 263 place count 107 transition count 147
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 270 place count 100 transition count 140
Iterating global reduction 4 with 7 rules applied. Total rules applied 277 place count 100 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 280 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 282 place count 98 transition count 135
Iterating global reduction 5 with 2 rules applied. Total rules applied 284 place count 98 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 286 place count 98 transition count 133
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 97 transition count 131
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 97 transition count 131
Applied a total of 288 rules in 8 ms. Remains 97 /223 variables (removed 126) and now considering 131/440 (removed 309) transitions.
// Phase 1: matrix 131 rows 97 cols
[2024-05-21 19:42:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:42:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:42:46] [INFO ] Invariant cache hit.
[2024-05-21 19:42:46] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 19:42:46] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 19:42:46] [INFO ] Invariant cache hit.
[2024-05-21 19:42:46] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/228 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 50/149 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:42:47] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:42:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:42:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:42:49] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:42:49] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/228 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 154 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/228 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 130/284 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 5/5 constraints]
After SMT, in 11018ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11020ms
Starting structural reductions in LTL mode, iteration 1 : 97/223 places, 131/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11235 ms. Remains : 97/223 places, 131/440 transitions.
[2024-05-21 19:42:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:42:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:57] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-21 19:42:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:42:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11717566718167017324.gal : 1 ms
[2024-05-21 19:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1995035650610479275.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/CTLFireability11717566718167017324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1995035650610479275.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45602e+06,14.7944,349584,2,33285,5,968530,6,0,519,1.25002e+06,0


Converting to forward existential form...Done !
original formula: EF(((AX(((s1<1)||(l1229<1))) * ((s1<1)||(l525<1))) * ((s1<1)||(l419<1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((s1<1)||(l419<1))) * ((s1<1)||(l525<1))) * !(EX(!(((s1<1)||(l1229<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t30, t42, t43, t44, t45, t46, t48, t49, t50, t51, t53,...566
(forward)formula 0,1,24.8228,389544,1,0,275,1.46969e+06,281,101,3609,1.25002e+06,271
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 170 transition count 263
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 170 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 170 transition count 256
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 153 place count 130 transition count 206
Iterating global reduction 1 with 40 rules applied. Total rules applied 193 place count 130 transition count 206
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 207 place count 130 transition count 192
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 229 place count 108 transition count 156
Iterating global reduction 2 with 22 rules applied. Total rules applied 251 place count 108 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 260 place count 108 transition count 147
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 272 place count 96 transition count 128
Iterating global reduction 3 with 12 rules applied. Total rules applied 284 place count 96 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 287 place count 96 transition count 125
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 295 place count 88 transition count 117
Iterating global reduction 4 with 8 rules applied. Total rules applied 303 place count 88 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 306 place count 88 transition count 114
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 310 place count 84 transition count 105
Iterating global reduction 5 with 4 rules applied. Total rules applied 314 place count 84 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 316 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 317 place count 83 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 318 place count 83 transition count 101
Applied a total of 318 rules in 10 ms. Remains 83 /223 variables (removed 140) and now considering 101/440 (removed 339) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 19:43:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:43:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:43:22] [INFO ] Invariant cache hit.
[2024-05-21 19:43:22] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 19:43:22] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 19:43:22] [INFO ] Invariant cache hit.
[2024-05-21 19:43:22] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5076ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5077ms
Starting structural reductions in LTL mode, iteration 1 : 83/223 places, 101/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5251 ms. Remains : 83/223 places, 101/440 transitions.
[2024-05-21 19:43:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:43:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:27] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 19:43:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:27] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15322380830571899428.gal : 1 ms
[2024-05-21 19:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12630387360952420528.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/CTLFireability15322380830571899428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12630387360952420528.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19241e+06,3.85322,107788,2,15449,5,345875,6,0,433,398280,0


Converting to forward existential form...Done !
original formula: AX(EF(((s1>=1)&&(l488>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((s1>=1)&&(l488>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
(forward)formula 0,1,13.2931,304012,1,0,239,1.50156e+06,223,102,3044,960973,272
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 172 transition count 281
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 172 transition count 281
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 172 transition count 273
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 148 place count 134 transition count 228
Iterating global reduction 1 with 38 rules applied. Total rules applied 186 place count 134 transition count 228
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 203 place count 134 transition count 211
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 223 place count 114 transition count 177
Iterating global reduction 2 with 20 rules applied. Total rules applied 243 place count 114 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 254 place count 114 transition count 166
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 264 place count 104 transition count 150
Iterating global reduction 3 with 10 rules applied. Total rules applied 274 place count 104 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 104 transition count 149
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 283 place count 96 transition count 141
Iterating global reduction 4 with 8 rules applied. Total rules applied 291 place count 96 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 294 place count 96 transition count 138
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 297 place count 93 transition count 135
Iterating global reduction 5 with 3 rules applied. Total rules applied 300 place count 93 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 302 place count 93 transition count 133
Applied a total of 302 rules in 17 ms. Remains 93 /223 variables (removed 130) and now considering 133/440 (removed 307) transitions.
// Phase 1: matrix 133 rows 93 cols
[2024-05-21 19:43:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:43:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:43:41] [INFO ] Invariant cache hit.
[2024-05-21 19:43:41] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 19:43:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-21 19:43:41] [INFO ] Invariant cache hit.
[2024-05-21 19:43:41] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/226 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-21 19:43:43] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:43:43] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:43:43] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/226 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 152 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/226 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 54/152 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 132/284 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 284 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 10559ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10561ms
Starting structural reductions in LTL mode, iteration 1 : 93/223 places, 133/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10801 ms. Remains : 93/223 places, 133/440 transitions.
[2024-05-21 19:43:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:43:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:51] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 19:43:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability228853107319128905.gal : 2 ms
[2024-05-21 19:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14903276682054258346.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/CTLFireability228853107319128905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14903276682054258346.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,4.98271e+06,10.5965,246464,2,27950,5,777732,6,0,505,855008,0


Converting to forward existential form...Done !
original formula: (AF(!(A(!(((s1>=1)&&(l612>=1))) U ((s1>=1)&&(l611>=1))))) + (EG(((AG(((s1<1)||(l608<1))) + (s1<1)) + (l1306<1))) * AX(((((s1<1)||(l612<1)...211
=> equivalent forward existential formula: ([((Init * !(!(EG(!(!(!((E(!(((s1>=1)&&(l611>=1))) U (!(!(((s1>=1)&&(l612>=1)))) * !(((s1>=1)&&(l611>=1))))) + E...674
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t...531
Detected timeout of ITS tools.
[2024-05-21 19:44:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:44:21] [INFO ] Applying decomposition
[2024-05-21 19:44:21] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph901864384731275570.txt' '-o' '/tmp/graph901864384731275570.bin' '-w' '/tmp/graph901864384731275570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph901864384731275570.bin' '-l' '-1' '-v' '-w' '/tmp/graph901864384731275570.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:44:21] [INFO ] Decomposing Gal with order
[2024-05-21 19:44:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:44:21] [INFO ] Removed a total of 157 redundant transitions.
[2024-05-21 19:44:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 4 ms.
[2024-05-21 19:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6319223774113079061.gal : 2 ms
[2024-05-21 19:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1331514267760758998.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/CTLFireability6319223774113079061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1331514267760758998.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.98271e+06,7.10532,147732,3034,1084,150719,24651,412,892704,107,148270,0


Converting to forward existential form...Done !
original formula: (AF(!(A(!(((i0.u1.s1>=1)&&(i3.u5.l612>=1))) U ((i0.u1.s1>=1)&&(i2.u10.l611>=1))))) + (EG(((AG(((i0.u1.s1<1)||(i3.u12.l608<1))) + (i0.u1.s...299
=> equivalent forward existential formula: ([((Init * !(!(EG(!(!(!((E(!(((i0.u1.s1>=1)&&(i2.u10.l611>=1))) U (!(!(((i0.u1.s1>=1)&&(i3.u5.l612>=1)))) * !(((...890
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t11, t13, t43, t45, t47, t48, t49, t50, t51, t54, t55, t56, t58, t59, t60, t61, t70, ...554
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 175 transition count 296
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 175 transition count 296
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 175 transition count 285
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 144 place count 138 transition count 241
Iterating global reduction 1 with 37 rules applied. Total rules applied 181 place count 138 transition count 241
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 200 place count 138 transition count 222
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 219 place count 119 transition count 189
Iterating global reduction 2 with 19 rules applied. Total rules applied 238 place count 119 transition count 189
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 250 place count 119 transition count 177
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 260 place count 109 transition count 163
Iterating global reduction 3 with 10 rules applied. Total rules applied 270 place count 109 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 272 place count 109 transition count 161
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 279 place count 102 transition count 154
Iterating global reduction 4 with 7 rules applied. Total rules applied 286 place count 102 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 289 place count 102 transition count 151
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 291 place count 100 transition count 149
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 100 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 295 place count 100 transition count 147
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 296 place count 99 transition count 145
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 99 transition count 145
Applied a total of 297 rules in 7 ms. Remains 99 /223 variables (removed 124) and now considering 145/440 (removed 295) transitions.
// Phase 1: matrix 145 rows 99 cols
[2024-05-21 19:44:51] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:44:51] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 19:44:51] [INFO ] Invariant cache hit.
[2024-05-21 19:44:52] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 19:44:52] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-21 19:44:52] [INFO ] Invariant cache hit.
[2024-05-21 19:44:52] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/244 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 59/160 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 160 constraints, problems are : Problem set: 0 solved, 144 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/244 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 59/160 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 144/304 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 304 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 10456ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 10457ms
Starting structural reductions in LTL mode, iteration 1 : 99/223 places, 145/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10675 ms. Remains : 99/223 places, 145/440 transitions.
[2024-05-21 19:45:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:45:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:45:02] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-21 19:45:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:45:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12282025006972433583.gal : 1 ms
[2024-05-21 19:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6211109972679238728.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/CTLFireability12282025006972433583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6211109972679238728.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,9.46692e+06,17.6197,437412,2,33856,5,1.39957e+06,6,0,541,1.48839e+06,0


Converting to forward existential form...Done !
original formula: E(AF((!((((p26>=1)&&(l0>=1))||((s1>=1)&&(l612>=1)))) * AG(((s1>=1)&&(l1235>=1))))) U EX(((AX(((s1>=1)&&(l606>=1))) * (p119>=1)) * (l531>=...160
=> equivalent forward existential formula: [(((EY(FwdU(Init,!(EG(!((!((((p26>=1)&&(l0>=1))||((s1>=1)&&(l612>=1)))) * !(E(TRUE U !(((s1>=1)&&(l1235>=1))))))...230
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...614
Detected timeout of ITS tools.
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:45:32] [INFO ] Applying decomposition
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13810834610468084263.txt' '-o' '/tmp/graph13810834610468084263.bin' '-w' '/tmp/graph13810834610468084263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13810834610468084263.bin' '-l' '-1' '-v' '-w' '/tmp/graph13810834610468084263.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:45:32] [INFO ] Decomposing Gal with order
[2024-05-21 19:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:45:32] [INFO ] Removed a total of 169 redundant transitions.
[2024-05-21 19:45:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 6 ms.
[2024-05-21 19:45:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11920453441081715886.gal : 1 ms
[2024-05-21 19:45:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16869525102674214111.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/CTLFireability11920453441081715886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16869525102674214111.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,9.46692e+06,14.6084,381132,3949,1552,257886,34631,505,3.50571e+06,146,174110,0


Converting to forward existential form...Done !
original formula: E(AF((!((((i2.u8.p26>=1)&&(i1.u0.l0>=1))||((i1.u0.s1>=1)&&(i2.u8.l612>=1)))) * AG(((i1.u0.s1>=1)&&(i4.u18.l1235>=1))))) U EX(((AX(((i1.u0...229
=> equivalent forward existential formula: [(((EY(FwdU(Init,!(EG(!((!((((i2.u8.p26>=1)&&(i1.u0.l0>=1))||((i1.u0.s1>=1)&&(i2.u8.l612>=1)))) * !(E(TRUE U !((...299
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t41, t43, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t57, t58, t59, t60, t61...593
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 173 transition count 277
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 173 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 108 place count 173 transition count 269
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 146 place count 135 transition count 221
Iterating global reduction 1 with 38 rules applied. Total rules applied 184 place count 135 transition count 221
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 196 place count 135 transition count 209
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 216 place count 115 transition count 177
Iterating global reduction 2 with 20 rules applied. Total rules applied 236 place count 115 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 244 place count 115 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 254 place count 105 transition count 153
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 105 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 267 place count 105 transition count 150
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 274 place count 98 transition count 143
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 98 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 283 place count 98 transition count 141
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 287 place count 94 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 94 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 293 place count 94 transition count 130
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 93 transition count 128
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 93 transition count 128
Applied a total of 295 rules in 14 ms. Remains 93 /223 variables (removed 130) and now considering 128/440 (removed 312) transitions.
// Phase 1: matrix 128 rows 93 cols
[2024-05-21 19:46:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:46:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:46:02] [INFO ] Invariant cache hit.
[2024-05-21 19:46:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 19:46:02] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-21 19:46:02] [INFO ] Invariant cache hit.
[2024-05-21 19:46:02] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-21 19:46:05] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-21 19:46:05] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-05-21 19:46:05] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/221 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-21 19:46:06] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:46:06] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 148 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/221 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 48/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 127/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 275 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints]
After SMT, in 10952ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 10954ms
Starting structural reductions in LTL mode, iteration 1 : 93/223 places, 128/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11160 ms. Remains : 93/223 places, 128/440 transitions.
[2024-05-21 19:46:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:46:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:46:13] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-21 19:46:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:46:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:46:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5751304132283862407.gal : 1 ms
[2024-05-21 19:46:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4779963597069184678.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/CTLFireability5751304132283862407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4779963597069184678.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,4.90754e+06,8.5203,247584,2,18507,5,871388,6,0,500,658786,0


Converting to forward existential form...Done !
original formula: AX(E(!(E(EF(((p66>=1)&&(l616>=1))) U E(((s1>=1)&&(l1028>=1)) U ((s2>=1)&&(l1254>=1))))) U EF(EX(((s1>=1)&&(l1219>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(E(TRUE U ((p66>=1)&&(l616>=1))) U E(((s1>=1)&&(l1028>=1)) U ((s2>=1)&&(l1254>=1))))) U E(TR...198
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t51, t53, t55, t66, t67, t68, t69, t70, t83, t92, t...456
Detected timeout of ITS tools.
[2024-05-21 19:46:43] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:46:43] [INFO ] Applying decomposition
[2024-05-21 19:46:43] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5040556027439089515.txt' '-o' '/tmp/graph5040556027439089515.bin' '-w' '/tmp/graph5040556027439089515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5040556027439089515.bin' '-l' '-1' '-v' '-w' '/tmp/graph5040556027439089515.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:46:43] [INFO ] Decomposing Gal with order
[2024-05-21 19:46:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:46:44] [INFO ] Removed a total of 123 redundant transitions.
[2024-05-21 19:46:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 3 ms.
[2024-05-21 19:46:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6471071042239156905.gal : 1 ms
[2024-05-21 19:46:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6547796538958495658.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/CTLFireability6471071042239156905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6547796538958495658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90754e+06,6.18088,166904,2880,815,145660,14714,390,1.16456e+06,149,135519,0


Converting to forward existential form...Done !
original formula: AX(E(!(E(EF(((i0.u8.p66>=1)&&(i6.u16.l616>=1))) U E(((i0.u1.s1>=1)&&(i6.u16.l1028>=1)) U ((i0.u1.s2>=1)&&(i3.u17.l1254>=1))))) U EF(EX(((...191
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(E(TRUE U ((i0.u8.p66>=1)&&(i6.u16.l616>=1))) U E(((i0.u1.s1>=1)&&(i6.u16.l1028>=1)) U ((i0....250
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t11, t45, t46, t51, t53, t55, t66, t67, t69, t70, t83, t93, t94, t95, t96, t99, t...452
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 171 transition count 264
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 171 transition count 264
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 111 place count 171 transition count 257
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 150 place count 132 transition count 208
Iterating global reduction 1 with 39 rules applied. Total rules applied 189 place count 132 transition count 208
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 203 place count 132 transition count 194
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 224 place count 111 transition count 160
Iterating global reduction 2 with 21 rules applied. Total rules applied 245 place count 111 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 253 place count 111 transition count 152
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 265 place count 99 transition count 133
Iterating global reduction 3 with 12 rules applied. Total rules applied 277 place count 99 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 280 place count 99 transition count 130
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 288 place count 91 transition count 122
Iterating global reduction 4 with 8 rules applied. Total rules applied 296 place count 91 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 299 place count 91 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 302 place count 88 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 305 place count 88 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 307 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 308 place count 87 transition count 112
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 87 transition count 112
Applied a total of 309 rules in 25 ms. Remains 87 /223 variables (removed 136) and now considering 112/440 (removed 328) transitions.
// Phase 1: matrix 112 rows 87 cols
[2024-05-21 19:47:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:47:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 19:47:14] [INFO ] Invariant cache hit.
[2024-05-21 19:47:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 19:47:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 19:47:14] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-21 19:47:14] [INFO ] Invariant cache hit.
[2024-05-21 19:47:14] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 5807ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 5808ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/223 places, 112/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6019 ms. Remains : 87/223 places, 112/440 transitions.
[2024-05-21 19:47:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:47:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:47:20] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 19:47:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:47:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:47:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10299258728623611729.gal : 1 ms
[2024-05-21 19:47:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17331464586317070052.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/CTLFireability10299258728623611729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17331464586317070052.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.55499e+06,6.59676,183772,2,20291,5,557421,6,0,460,686806,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l526<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l526<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/110
(forward)formula 0,1,21.7228,503316,1,0,20,1.82607e+06,19,4,2448,1.68609e+06,16
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-13 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 : 223/223 places, 440/440 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 172 transition count 275
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 172 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 112 place count 172 transition count 265
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 151 place count 133 transition count 216
Iterating global reduction 1 with 39 rules applied. Total rules applied 190 place count 133 transition count 216
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 204 place count 133 transition count 202
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 113 transition count 169
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 113 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 252 place count 113 transition count 161
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 263 place count 102 transition count 144
Iterating global reduction 3 with 11 rules applied. Total rules applied 274 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 277 place count 102 transition count 141
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 284 place count 95 transition count 134
Iterating global reduction 4 with 7 rules applied. Total rules applied 291 place count 95 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 294 place count 95 transition count 131
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 297 place count 92 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 300 place count 92 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 301 place count 91 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 91 transition count 121
Applied a total of 302 rules in 28 ms. Remains 91 /223 variables (removed 132) and now considering 121/440 (removed 319) transitions.
// Phase 1: matrix 121 rows 91 cols
[2024-05-21 19:47:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:47:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 19:47:42] [INFO ] Invariant cache hit.
[2024-05-21 19:47:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 19:47:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 19:47:42] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-21 19:47:42] [INFO ] Invariant cache hit.
[2024-05-21 19:47:42] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/212 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 137 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/212 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 120/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4723 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 6917ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 6918ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/223 places, 121/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7158 ms. Remains : 91/223 places, 121/440 transitions.
[2024-05-21 19:47:49] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:47:49] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:47:49] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-21 19:47:49] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:47:49] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9193275578560661928.gal : 1 ms
[2024-05-21 19:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2904939780416988767.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/CTLFireability9193275578560661928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2904939780416988767.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,5.03419e+06,8.54703,227812,2,21066,5,762778,6,0,485,812158,0


Converting to forward existential form...Done !
original formula: EF(AG(((AF(((s1>=1)&&(l36>=1))) * E(((s1>=1)&&(l1222>=1)) U ((s1>=1)&&(l1026>=1)))) * ((s1<1)||(l1222<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!(((s1>=1)&&(l36>=1))))) * E(((s1>=1)&&(l1222>=1)) U ((s1>=1)&&(l1026>=1...196
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t39, t45, t46, t47, t53, t54, t56, t58, t64, t65, t66,...461
(forward)formula 0,0,27.3118,624500,1,0,367,3.32818e+06,276,145,3421,2.4324e+06,418
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 440/440 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 172 transition count 266
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 172 transition count 266
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 172 transition count 260
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 146 place count 134 transition count 212
Iterating global reduction 1 with 38 rules applied. Total rules applied 184 place count 134 transition count 212
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 198 place count 134 transition count 198
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 219 place count 113 transition count 165
Iterating global reduction 2 with 21 rules applied. Total rules applied 240 place count 113 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 249 place count 113 transition count 156
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 260 place count 102 transition count 138
Iterating global reduction 3 with 11 rules applied. Total rules applied 271 place count 102 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 102 transition count 135
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 281 place count 95 transition count 128
Iterating global reduction 4 with 7 rules applied. Total rules applied 288 place count 95 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 291 place count 95 transition count 125
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 93 transition count 123
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 93 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 297 place count 93 transition count 121
Applied a total of 297 rules in 24 ms. Remains 93 /223 variables (removed 130) and now considering 121/440 (removed 319) transitions.
// Phase 1: matrix 121 rows 93 cols
[2024-05-21 19:48:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:48:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:48:16] [INFO ] Invariant cache hit.
[2024-05-21 19:48:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 19:48:16] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-21 19:48:16] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-21 19:48:16] [INFO ] Invariant cache hit.
[2024-05-21 19:48:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 137 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 120/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 257 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 6836ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 6838ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/223 places, 121/440 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7055 ms. Remains : 93/223 places, 121/440 transitions.
[2024-05-21 19:48:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:48:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:48:23] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-21 19:48:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:48:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:48:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13213162465975648390.gal : 1 ms
[2024-05-21 19:48:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10621052757099981301.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/CTLFireability13213162465975648390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10621052757099981301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73701e+06,6.95381,200868,2,25160,5,640376,6,0,493,721862,0


Converting to forward existential form...Done !
original formula: AF(((AF(((s1>=1)&&(l465>=1))) * (s1>=1)) * (l320>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((s1>=1)&&(l465>=1))))) * (s1>=1)) * (l320>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t35, t39, t47, t53, t60, t61, t62, t64, t80, t87, t88, t89, t90, t91, t...419
Detected timeout of ITS tools.
[2024-05-21 19:48:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:48:53] [INFO ] Applying decomposition
[2024-05-21 19:48:53] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10554125315972101369.txt' '-o' '/tmp/graph10554125315972101369.bin' '-w' '/tmp/graph10554125315972101369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10554125315972101369.bin' '-l' '-1' '-v' '-w' '/tmp/graph10554125315972101369.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:48:53] [INFO ] Decomposing Gal with order
[2024-05-21 19:48:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:48:53] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-21 19:48:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:48:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2024-05-21 19:48:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13594729317582047948.gal : 1 ms
[2024-05-21 19:48:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4661140598998467527.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/CTLFireability13594729317582047948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4661140598998467527.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73701e+06,1.07186,38912,1969,843,48472,4656,362,148221,136,51086,0


Converting to forward existential form...Done !
original formula: AF(((AF(((i2.u2.s1>=1)&&(u9.l465>=1))) * (i2.u2.s1>=1)) * (i2.u2.l320>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((i2.u2.s1>=1)&&(u9.l465>=1))))) * (i2.u2.s1>=1)) * (i2.u2.l320>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t39, t46, t48, t53, t60, t64, t80, t87, t89, t90, t92, t93, t94, t95, t96, t97, t98,...420
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.98686,209944,1,0,274223,37766,1613,954333,781,276771,503102
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:49:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:49:01] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:49:01] [INFO ] Applying decomposition
[2024-05-21 19:49:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12637257519744157464.txt' '-o' '/tmp/graph12637257519744157464.bin' '-w' '/tmp/graph12637257519744157464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12637257519744157464.bin' '-l' '-1' '-v' '-w' '/tmp/graph12637257519744157464.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:49:01] [INFO ] Decomposing Gal with order
[2024-05-21 19:49:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:49:01] [INFO ] Removed a total of 538 redundant transitions.
[2024-05-21 19:49:01] [INFO ] Flatten gal took : 26 ms
[2024-05-21 19:49:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 8 ms.
[2024-05-21 19:49:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9962159267740591566.gal : 3 ms
[2024-05-21 19:49:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17773576065190681253.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/CTLFireability9962159267740591566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17773576065190681253.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 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 19:56:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9624891127969889346.gal : 3 ms
[2024-05-21 19:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12265155781003446804.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/CTLFireability9624891127969889346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12265155781003446804.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 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 20:07:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:07:37] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-21 20:07:37] [INFO ] Transformed 223 places.
[2024-05-21 20:07:37] [INFO ] Transformed 440 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 20:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6193911711826860936.gal : 2 ms
[2024-05-21 20:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8194820175454046721.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/CTLFireability6193911711826860936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8194820175454046721.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.58441e+08,519.005,4478488,2,316865,5,1.8137e+07,6,0,1332,4.17436e+06,0


Converting to forward existential form...Done !
original formula: (EF(!(E(!(((s1>=1)&&(l610>=1))) U (!(AF(((s1>=1)&&(l606>=1)))) * E(((s1>=1)&&(l1215>=1)) U ((s1>=1)&&(l1024>=1))))))) * E((EF(((p28>=1)&&...221
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U !(E(!(((s1>=1)&&(l610>=1))) U (!(!(EG(!(((s1>=1)&&(l606>=1)))))) * E(((s1>=1)&&(l121...289
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t20, t21, t24, t25, t26, t28, t29, t38, t39, t40, t41,...1908
Detected timeout of ITS tools.
Total runtime 3273658 ms.

BK_STOP 1716323496914

--------------------
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="DBSingleClientW-PT-d1m07"
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 DBSingleClientW-PT-d1m07, 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 r092-tall-171624189400514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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