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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 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.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 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-d1m06-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716319967209

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:32:48] [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:32:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:32:48] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 19:32:48] [INFO ] Transformed 1440 places.
[2024-05-21 19:32:48] [INFO ] Transformed 672 transitions.
[2024-05-21 19:32:48] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 88 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 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 164 place count 263 transition count 483
Iterating global reduction 1 with 63 rules applied. Total rules applied 227 place count 263 transition count 483
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 239 place count 263 transition count 471
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 274 place count 228 transition count 436
Iterating global reduction 2 with 35 rules applied. Total rules applied 309 place count 228 transition count 436
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 321 place count 216 transition count 419
Iterating global reduction 2 with 12 rules applied. Total rules applied 333 place count 216 transition count 419
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 348 place count 216 transition count 404
Applied a total of 348 rules in 72 ms. Remains 216 /347 variables (removed 131) and now considering 404/672 (removed 268) transitions.
// Phase 1: matrix 404 rows 216 cols
[2024-05-21 19:32:48] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 19:32:49] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 19:32:49] [INFO ] Invariant cache hit.
[2024-05-21 19:32:49] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 19:32:49] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 403 sub problems to find dead transitions.
[2024-05-21 19:32:49] [INFO ] Invariant cache hit.
[2024-05-21 19:32:49] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 404/620 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 210/428 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 0/620 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 428 constraints, problems are : Problem set: 0 solved, 403 unsolved in 22606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 404/620 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 210/428 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 403/831 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/620 variables, and 831 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 53726ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 53744ms
Starting structural reductions in LTL mode, iteration 1 : 216/347 places, 404/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54600 ms. Remains : 216/347 places, 404/672 transitions.
Support contains 88 out of 216 places after structural reductions.
[2024-05-21 19:33:43] [INFO ] Flatten gal took : 52 ms
[2024-05-21 19:33:43] [INFO ] Flatten gal took : 27 ms
[2024-05-21 19:33:43] [INFO ] Input system was already deterministic with 404 transitions.
Support contains 85 out of 216 places (down from 88) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 67
RANDOM walk for 40000 steps (9092 resets) in 2896 ms. (13 steps per ms) remains 52/67 properties
BEST_FIRST walk for 4004 steps (184 resets) in 84 ms. (47 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (170 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (400 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (201 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (387 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (387 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (173 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (379 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (196 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (364 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (205 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (433 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (153 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (215 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (194 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (390 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (179 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (398 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (197 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (165 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (189 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (193 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (165 resets) in 94 ms. (42 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (183 resets) in 58 ms. (67 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (390 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (188 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (414 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (161 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (383 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (175 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (401 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (179 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (202 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (203 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (397 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (171 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (168 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (208 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (378 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (185 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (181 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (196 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (384 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (197 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (173 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (394 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (394 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
[2024-05-21 19:33:44] [INFO ] Invariant cache hit.
[2024-05-21 19:33:44] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/130 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 37/167 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 357/524 variables, 167/169 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 163/332 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/332 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 94/618 variables, 48/380 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 46/426 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/426 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 2/620 variables, 1/427 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/620 variables, 1/428 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/428 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/620 variables, 0/428 constraints. Problems are: Problem set: 5 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 428 constraints, problems are : Problem set: 5 solved, 46 unsolved in 4286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 68/127 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-05-21 19:33:49] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 39/166 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 357/523 variables, 166/173 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 163/336 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 2/338 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:33:50] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 20/358 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:33:52] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 20/378 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:33:54] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:33:54] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:33:54] [INFO ] Deduced a trap composed of 83 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:33:54] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/620 variables, and 383 constraints, problems are : Problem set: 5 solved, 46 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/216 constraints, ReadFeed: 163/210 constraints, PredecessorRefiner: 2/51 constraints, Known Traps: 50/50 constraints]
After SMT, in 9486ms problems are : Problem set: 5 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 203 transition count 379
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 203 transition count 379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 199 transition count 375
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 199 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 197 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 197 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 197 transition count 372
Applied a total of 39 rules in 52 ms. Remains 197 /216 variables (removed 19) and now considering 372/404 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 197/216 places, 372/404 transitions.
RANDOM walk for 40000 steps (9133 resets) in 630 ms. (63 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4002 steps (183 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (186 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (182 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (406 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (428 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (194 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (193 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (402 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (194 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (359 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (175 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (177 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (184 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (415 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (181 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (188 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (363 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (193 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (194 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (190 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (188 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (196 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (411 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (196 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (398 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (377 resets) in 85 ms. (46 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (182 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (202 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (434 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (196 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (183 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (392 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (167 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (179 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (180 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (413 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (172 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (175 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (192 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (380 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (208 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (192 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (181 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (393 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
Finished probabilistic random walk after 437118 steps, run visited all 45 properties in 1840 ms. (steps per millisecond=237 )
Probabilistic random walk after 437118 steps, saw 165162 distinct states, run finished after 1843 ms. (steps per millisecond=237 ) properties seen :45
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:33:56] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:33:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:33:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 19:33:57] [INFO ] Input system was already deterministic with 404 transitions.
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 828 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 168 transition count 265
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 168 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 168 transition count 258
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 135 place count 136 transition count 219
Iterating global reduction 1 with 32 rules applied. Total rules applied 167 place count 136 transition count 219
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 180 place count 136 transition count 206
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 198 place count 118 transition count 178
Iterating global reduction 2 with 18 rules applied. Total rules applied 216 place count 118 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 221 place count 118 transition count 173
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 232 place count 107 transition count 154
Iterating global reduction 3 with 11 rules applied. Total rules applied 243 place count 107 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 247 place count 107 transition count 150
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 253 place count 101 transition count 144
Iterating global reduction 4 with 6 rules applied. Total rules applied 259 place count 101 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 101 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 264 place count 97 transition count 139
Iterating global reduction 5 with 4 rules applied. Total rules applied 268 place count 97 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 270 place count 97 transition count 137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 96 transition count 135
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 96 transition count 135
Applied a total of 272 rules in 16 ms. Remains 96 /216 variables (removed 120) and now considering 135/404 (removed 269) transitions.
// Phase 1: matrix 135 rows 96 cols
[2024-05-21 19:33:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:33:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:33:57] [INFO ] Invariant cache hit.
[2024-05-21 19:33:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 19:33:57] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-21 19:33:57] [INFO ] Invariant cache hit.
[2024-05-21 19:33:57] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/231 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:33:58] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:33:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:33:59] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:33:59] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 155 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/231 variables, 96/102 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 53/155 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 134/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 289 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 4/4 constraints]
After SMT, in 9719ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 9720ms
Starting structural reductions in LTL mode, iteration 1 : 96/216 places, 135/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9945 ms. Remains : 96/216 places, 135/404 transitions.
[2024-05-21 19:34:06] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:34:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:34:07] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-21 19:34:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:34:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:34:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13790708530561596028.gal : 3 ms
[2024-05-21 19:34:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9535851797921477650.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/CTLFireability13790708530561596028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9535851797921477650.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF(((E(AX(((s1>=1)&&(l303>=1))) U !(AX(((s1>=1)&&(l1284>=1))))) * (s1>=1)) * (l612>=1))) + AX((((s9<1)||(l0<1)) * AF(((p75>=1)&&(l405>=1...161
=> equivalent forward existential formula: ([(EY((Init * !(!(EG(!(((E(!(EX(!(((s1>=1)&&(l303>=1))))) U !(!(EX(!(((s1>=1)&&(l1284>=1))))))) * (s1>=1)) * (l6...367
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t42, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t...518
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:34:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:34:37] [INFO ] Applying decomposition
[2024-05-21 19:34:37] [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/graph7375502949750052541.txt' '-o' '/tmp/graph7375502949750052541.bin' '-w' '/tmp/graph7375502949750052541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7375502949750052541.bin' '-l' '-1' '-v' '-w' '/tmp/graph7375502949750052541.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:34:37] [INFO ] Decomposing Gal with order
[2024-05-21 19:34:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:34:37] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-21 19:34:37] [INFO ] Flatten gal took : 41 ms
[2024-05-21 19:34:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 7 ms.
[2024-05-21 19:34:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4236438555588402131.gal : 4 ms
[2024-05-21 19:34:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10969160113023635267.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/CTLFireability4236438555588402131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10969160113023635267.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18931e+06,1.96673,62972,1668,1415,53789,24180,359,307813,226,243476,0


Converting to forward existential form...Done !
original formula: (AF(((E(AX(((i0.u0.s1>=1)&&(i0.u0.l303>=1))) U !(AX(((i0.u0.s1>=1)&&(i6.u17.l1284>=1))))) * (i0.u0.s1>=1)) * (i0.u0.l612>=1))) + AX((((i0...222
=> equivalent forward existential formula: ([(EY((Init * !(!(EG(!(((E(!(EX(!(((i0.u0.s1>=1)&&(i0.u0.l303>=1))))) U !(!(EX(!(((i0.u0.s1>=1)&&(i6.u17.l1284>=...465
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t11, t41, t73, t74, t87, t91, t92, t93, t95, t100, t101, t102, t103, t104, t106, t107...607
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.99923,215156,1,0,216348,90769,1814,901540,1266,839147,548267
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 168 transition count 265
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 168 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 168 transition count 258
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 134 place count 137 transition count 220
Iterating global reduction 1 with 31 rules applied. Total rules applied 165 place count 137 transition count 220
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 178 place count 137 transition count 207
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 196 place count 119 transition count 179
Iterating global reduction 2 with 18 rules applied. Total rules applied 214 place count 119 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 219 place count 119 transition count 174
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 230 place count 108 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 241 place count 108 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 244 place count 108 transition count 152
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 249 place count 103 transition count 147
Iterating global reduction 4 with 5 rules applied. Total rules applied 254 place count 103 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 103 transition count 146
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 100 transition count 143
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 100 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 262 place count 99 transition count 141
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 99 transition count 141
Applied a total of 263 rules in 19 ms. Remains 99 /216 variables (removed 117) and now considering 141/404 (removed 263) transitions.
// Phase 1: matrix 141 rows 99 cols
[2024-05-21 19:34:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:34:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:34:46] [INFO ] Invariant cache hit.
[2024-05-21 19:34:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 19:34:46] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-21 19:34:46] [INFO ] Invariant cache hit.
[2024-05-21 19:34:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/240 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 157 constraints, problems are : Problem set: 0 solved, 140 unsolved in 2701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/240 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 140/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 297 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 10792ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 10794ms
Starting structural reductions in LTL mode, iteration 1 : 99/216 places, 141/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11043 ms. Remains : 99/216 places, 141/404 transitions.
[2024-05-21 19:34:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:34:57] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:34:57] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-21 19:34:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:34:57] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5093351861088219341.gal : 2 ms
[2024-05-21 19:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2943136659942964609.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/CTLFireability5093351861088219341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2943136659942964609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((((p99>=1)&&(l0>=1)) + (((s1>=1)&&(l612>=1)) * ((EG((AX(((s1>=1)&&(l1254>=1))) + E(((s1>=1)&&(l1282>=1)) U ((p88>=1)&&(l447>=1))))) + ...232
=> equivalent forward existential formula: [FwdG(Init,!((((p99>=1)&&(l0>=1)) + (((s1>=1)&&(l612>=1)) * ((EG((!(EX(!(((s1>=1)&&(l1254>=1))))) + E(((s1>=1)&&...283
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t41, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t...576
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:35:27] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:35:27] [INFO ] Applying decomposition
[2024-05-21 19:35:27] [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/graph7819935370969659185.txt' '-o' '/tmp/graph7819935370969659185.bin' '-w' '/tmp/graph7819935370969659185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7819935370969659185.bin' '-l' '-1' '-v' '-w' '/tmp/graph7819935370969659185.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:35:27] [INFO ] Decomposing Gal with order
[2024-05-21 19:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:35:27] [INFO ] Removed a total of 158 redundant transitions.
[2024-05-21 19:35:27] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 4 ms.
[2024-05-21 19:35:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17305587059741711595.gal : 2 ms
[2024-05-21 19:35:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15316020246241171615.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/CTLFireability17305587059741711595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15316020246241171615.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46406e+06,2.24539,68812,2407,795,75548,8529,397,397591,165,61481,0


Converting to forward existential form...Done !
original formula: AF((((i7.u19.p99>=1)&&(i3.u2.l0>=1)) + (((i0.u0.s1>=1)&&(i0.u0.l612>=1)) * ((EG((AX(((i0.u0.s1>=1)&&(i6.u15.l1254>=1))) + E(((i0.u0.s1>=1...333
=> equivalent forward existential formula: [FwdG(Init,!((((i7.u19.p99>=1)&&(i3.u2.l0>=1)) + (((i0.u0.s1>=1)&&(i0.u0.l612>=1)) * ((EG((!(EX(!(((i0.u0.s1>=1)...384
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t11, t40, t64, t67, t69, t71, t89, t94, t95, t96, t97, t98, t103, t106, t107, t108, t...631
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,10.089,227740,1,0,297709,24344,1913,1.27647e+06,874,155753,783051
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 168 transition count 270
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 168 transition count 270
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 108 place count 168 transition count 258
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 138 place count 138 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 168 place count 138 transition count 221
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 181 place count 138 transition count 208
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 198 place count 121 transition count 182
Iterating global reduction 2 with 17 rules applied. Total rules applied 215 place count 121 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 218 place count 121 transition count 179
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 229 place count 110 transition count 160
Iterating global reduction 3 with 11 rules applied. Total rules applied 240 place count 110 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 248 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 255 place count 103 transition count 140
Iterating global reduction 4 with 7 rules applied. Total rules applied 262 place count 103 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 103 transition count 139
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 267 place count 99 transition count 135
Iterating global reduction 5 with 4 rules applied. Total rules applied 271 place count 99 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 99 transition count 134
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 273 place count 98 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 98 transition count 132
Applied a total of 274 rules in 13 ms. Remains 98 /216 variables (removed 118) and now considering 132/404 (removed 272) transitions.
// Phase 1: matrix 132 rows 98 cols
[2024-05-21 19:35:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:35:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 19:35:37] [INFO ] Invariant cache hit.
[2024-05-21 19:35:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 19:35:37] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-05-21 19:35:37] [INFO ] Invariant cache hit.
[2024-05-21 19:35:37] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/230 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 149 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/230 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 131/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 280 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 8968ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 8969ms
Starting structural reductions in LTL mode, iteration 1 : 98/216 places, 132/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9247 ms. Remains : 98/216 places, 132/404 transitions.
[2024-05-21 19:35:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:35:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:35:46] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-21 19:35:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:35:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:35:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12933677978407610514.gal : 1 ms
[2024-05-21 19:35:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6825291085522061836.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/CTLFireability12933677978407610514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6825291085522061836.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,965708,3.40697,105688,2,15603,5,303102,6,0,524,346330,0


Converting to forward existential form...Done !
original formula: EG(AX((AG((A(((s1>=1)&&(l1223>=1)) U ((s6>=1)&&(l0>=1))) * AG(((s1>=1)&&(l608>=1))))) + (AF(((s1<1)||(l434<1))) * (!(E(((s1>=1)&&(l608>=1...211
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(E(TRUE U !((!((E(!(((s6>=1)&&(l0>=1))) U (!(((s1>=1)&&(l1223>=1))) * !(((s6>=1)&&(l0>=1))))...355
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t29, t43, t49, t52, t53, t54, t55, t56, t57, t58, t59, t60, t65, t68, t...485
(forward)formula 0,1,13.2036,326948,1,0,450,1.20174e+06,309,243,3749,1.30903e+06,471
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 167 transition count 273
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 167 transition count 273
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 108 place count 167 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 140 place count 135 transition count 225
Iterating global reduction 1 with 32 rules applied. Total rules applied 172 place count 135 transition count 225
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 186 place count 135 transition count 211
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 204 place count 117 transition count 183
Iterating global reduction 2 with 18 rules applied. Total rules applied 222 place count 117 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 227 place count 117 transition count 178
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 238 place count 106 transition count 159
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 106 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 252 place count 106 transition count 156
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 258 place count 100 transition count 150
Iterating global reduction 4 with 6 rules applied. Total rules applied 264 place count 100 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 100 transition count 149
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 269 place count 96 transition count 145
Iterating global reduction 5 with 4 rules applied. Total rules applied 273 place count 96 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 96 transition count 144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 275 place count 95 transition count 142
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 95 transition count 142
Applied a total of 276 rules in 17 ms. Remains 95 /216 variables (removed 121) and now considering 142/404 (removed 262) transitions.
// Phase 1: matrix 142 rows 95 cols
[2024-05-21 19:36:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:36:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:36:00] [INFO ] Invariant cache hit.
[2024-05-21 19:36:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 19:36:00] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-21 19:36:00] [INFO ] Invariant cache hit.
[2024-05-21 19:36:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/237 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 158 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/237 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 141/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 8774ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 8783ms
Starting structural reductions in LTL mode, iteration 1 : 95/216 places, 142/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9052 ms. Remains : 95/216 places, 142/404 transitions.
[2024-05-21 19:36:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:36:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:36:09] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-21 19:36:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:36:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:36:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13095959841581137876.gal : 2 ms
[2024-05-21 19:36:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6360305018238053864.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/CTLFireability13095959841581137876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6360305018238053864.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,938763,4.72892,140788,2,16285,5,429345,6,0,522,447627,0


Converting to forward existential form...Done !
original formula: (AF(EG(((p34>=1)&&(l0>=1)))) * EF((((EX(((s1>=1)&&(l1025>=1))) * EF(((s1>=1)&&(l608>=1)))) * ((s1>=1)&&(l950>=1))) * ((s1<1)||(l606<1))))...156
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((p34>=1)&&(l0>=1)))))] = FALSE * [(Init * !(E(TRUE U (((EX(((s1>=1)&&(l1025>=1))) * E(TRUE U (...235
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t...593
Detected timeout of ITS tools.
[2024-05-21 19:36:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:36:39] [INFO ] Applying decomposition
[2024-05-21 19:36:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12884894046377810257.txt' '-o' '/tmp/graph12884894046377810257.bin' '-w' '/tmp/graph12884894046377810257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12884894046377810257.bin' '-l' '-1' '-v' '-w' '/tmp/graph12884894046377810257.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:36:39] [INFO ] Decomposing Gal with order
[2024-05-21 19:36:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:36:39] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-21 19:36:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:36:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 3 ms.
[2024-05-21 19:36:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5473182219292438099.gal : 2 ms
[2024-05-21 19:36:39] [INFO ] Time to serialize properties into /tmp/CTLFireability18408548689703048429.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/CTLFireability5473182219292438099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18408548689703048429.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,938763,1.33357,50576,1146,1703,32672,44054,332,91373,226,466388,0


Converting to forward existential form...Done !
original formula: (AF(EG(((u0.p34>=1)&&(i1.u2.l0>=1)))) * EF((((EX(((u0.s1>=1)&&(i4.u12.l1025>=1))) * EF(((u0.s1>=1)&&(u0.l608>=1)))) * ((u0.s1>=1)&&(u10.l...194
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((u0.p34>=1)&&(i1.u2.l0>=1)))))] = FALSE * [(Init * !(E(TRUE U (((EX(((u0.s1>=1)&&(i4.u12.l1025...273
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t11, t41, t55, t56, t70, t72, t79, t89, t90, t92, t93, t99, t107, t108, t109, t11...657
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,6.04953,192968,1,0,175836,144586,1646,376325,1336,1.68837e+06,428964
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 164 transition count 247
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 164 transition count 247
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 164 transition count 241
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 142 place count 132 transition count 202
Iterating global reduction 1 with 32 rules applied. Total rules applied 174 place count 132 transition count 202
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 186 place count 132 transition count 190
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 205 place count 113 transition count 163
Iterating global reduction 2 with 19 rules applied. Total rules applied 224 place count 113 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 230 place count 113 transition count 157
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 241 place count 102 transition count 137
Iterating global reduction 3 with 11 rules applied. Total rules applied 252 place count 102 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 256 place count 102 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 262 place count 96 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 268 place count 96 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 272 place count 92 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 276 place count 92 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 91 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 91 transition count 114
Applied a total of 280 rules in 12 ms. Remains 91 /216 variables (removed 125) and now considering 114/404 (removed 290) transitions.
// Phase 1: matrix 114 rows 91 cols
[2024-05-21 19:36:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:36:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:36:45] [INFO ] Invariant cache hit.
[2024-05-21 19:36:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:36:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-21 19:36:45] [INFO ] Invariant cache hit.
[2024-05-21 19:36:45] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/205 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 127 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/205 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 113/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 240 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 6049ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6050ms
Starting structural reductions in LTL mode, iteration 1 : 91/216 places, 114/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6231 ms. Remains : 91/216 places, 114/404 transitions.
[2024-05-21 19:36:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:36:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:36:51] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-21 19:36:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:36:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:36:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5017633809099026427.gal : 1 ms
[2024-05-21 19:36:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3806558670365151951.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/CTLFireability5017633809099026427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3806558670365151951.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,940787,3.20355,98412,2,14912,5,294844,6,0,478,337987,0


Converting to forward existential form...Done !
original formula: EG((EG(((s1>=1)&&(l1234>=1))) + (AX(((s1<1)||(l941<1))) * EF(((s1<1)||(l970<1))))))
=> equivalent forward existential formula: [FwdG(Init,(EG(((s1>=1)&&(l1234>=1))) + (!(EX(!(((s1<1)||(l941<1))))) * E(TRUE U ((s1<1)||(l970<1))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t51, t52, t67, t68, t71, t72, t79, t80, t81, t82, t...422
(forward)formula 0,1,16.9552,442144,1,0,496,1.65864e+06,262,265,3385,2.22756e+06,461
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 166 transition count 268
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 166 transition count 268
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 110 place count 166 transition count 258
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 141 place count 135 transition count 220
Iterating global reduction 1 with 31 rules applied. Total rules applied 172 place count 135 transition count 220
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 187 place count 135 transition count 205
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 204 place count 118 transition count 180
Iterating global reduction 2 with 17 rules applied. Total rules applied 221 place count 118 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 226 place count 118 transition count 175
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 236 place count 108 transition count 157
Iterating global reduction 3 with 10 rules applied. Total rules applied 246 place count 108 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 252 place count 108 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 257 place count 103 transition count 141
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 103 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 265 place count 101 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 101 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 101 transition count 137
Applied a total of 268 rules in 17 ms. Remains 101 /216 variables (removed 115) and now considering 137/404 (removed 267) transitions.
// Phase 1: matrix 137 rows 101 cols
[2024-05-21 19:37:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:37:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:37:09] [INFO ] Invariant cache hit.
[2024-05-21 19:37:09] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 19:37:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 19:37:09] [INFO ] Invariant cache hit.
[2024-05-21 19:37:09] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 154 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 136/290 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 290 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9512ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9513ms
Starting structural reductions in LTL mode, iteration 1 : 101/216 places, 137/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9741 ms. Remains : 101/216 places, 137/404 transitions.
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:37:18] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:37:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3637447727819316926.gal : 1 ms
[2024-05-21 19:37:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7183396198214354191.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/CTLFireability3637447727819316926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7183396198214354191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((A(((s1>=1)&&(l1289>=1)) U ((s1>=1)&&(l610>=1))) * EX(EX(((s1>=1)&&(l1223>=1))))) * ((p57>=1)&&(l621>=1))))
=> equivalent forward existential formula: [(EY(EY(((FwdU(Init,TRUE) * ((p57>=1)&&(l621>=1))) * !((E(!(((s1>=1)&&(l610>=1))) U (!(((s1>=1)&&(l1289>=1))) * ...250
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t33, t34, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...555
(forward)formula 0,0,28.8568,697120,1,0,398,3.60046e+06,303,159,3807,2.54901e+06,434
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 164 transition count 252
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 164 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 164 transition count 244
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 145 place count 131 transition count 204
Iterating global reduction 1 with 33 rules applied. Total rules applied 178 place count 131 transition count 204
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 190 place count 131 transition count 192
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 209 place count 112 transition count 163
Iterating global reduction 2 with 19 rules applied. Total rules applied 228 place count 112 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 233 place count 112 transition count 158
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 245 place count 100 transition count 137
Iterating global reduction 3 with 12 rules applied. Total rules applied 257 place count 100 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 263 place count 100 transition count 131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 270 place count 93 transition count 119
Iterating global reduction 4 with 7 rules applied. Total rules applied 277 place count 93 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 93 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 282 place count 89 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 286 place count 89 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 88 transition count 111
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 88 transition count 111
Applied a total of 289 rules in 8 ms. Remains 88 /216 variables (removed 128) and now considering 111/404 (removed 293) transitions.
// Phase 1: matrix 111 rows 88 cols
[2024-05-21 19:37:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:37:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:37:47] [INFO ] Invariant cache hit.
[2024-05-21 19:37:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:37:48] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 19:37:48] [INFO ] Invariant cache hit.
[2024-05-21 19:37:48] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6044ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6045ms
Starting structural reductions in LTL mode, iteration 1 : 88/216 places, 111/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6238 ms. Remains : 88/216 places, 111/404 transitions.
[2024-05-21 19:37:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:37:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:37:54] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-21 19:37:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:37:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:37:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2686657181824951061.gal : 1 ms
[2024-05-21 19:37:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12942682812369369341.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/CTLFireability2686657181824951061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12942682812369369341.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,716029,1.93816,68576,2,12621,5,195047,6,0,463,251297,0


Converting to forward existential form...Done !
original formula: AG(AX(((s1<1)||(l1224<1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((s1<1)||(l1224<1))))] = FALSE
(forward)formula 0,0,2.09681,68576,1,0,9,195047,9,2,871,251297,2
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 172 transition count 295
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 172 transition count 295
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 100 place count 172 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 130 place count 142 transition count 246
Iterating global reduction 1 with 30 rules applied. Total rules applied 160 place count 142 transition count 246
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 173 place count 142 transition count 233
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 188 place count 127 transition count 213
Iterating global reduction 2 with 15 rules applied. Total rules applied 203 place count 127 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 207 place count 127 transition count 209
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 216 place count 118 transition count 195
Iterating global reduction 3 with 9 rules applied. Total rules applied 225 place count 118 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 229 place count 118 transition count 191
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 234 place count 113 transition count 181
Iterating global reduction 4 with 5 rules applied. Total rules applied 239 place count 113 transition count 181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 242 place count 110 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 245 place count 110 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 110 transition count 177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 109 transition count 175
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 109 transition count 175
Applied a total of 248 rules in 6 ms. Remains 109 /216 variables (removed 107) and now considering 175/404 (removed 229) transitions.
// Phase 1: matrix 175 rows 109 cols
[2024-05-21 19:37:56] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:37:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:37:56] [INFO ] Invariant cache hit.
[2024-05-21 19:37:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 19:37:56] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-21 19:37:56] [INFO ] Invariant cache hit.
[2024-05-21 19:37:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/284 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 19:37:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:37:59] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 8 ms to minimize.
[2024-05-21 19:37:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 189 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/284 variables, 109/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 75/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 174/363 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 363 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints]
After SMT, in 15600ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15604ms
Starting structural reductions in LTL mode, iteration 1 : 109/216 places, 175/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15835 ms. Remains : 109/216 places, 175/404 transitions.
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:38:12] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:38:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:38:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6161604285061360010.gal : 1 ms
[2024-05-21 19:38:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12014605155045075211.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/CTLFireability6161604285061360010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12014605155045075211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EX(((s1<1)||(l1021<1))) * ((EF((((s1>=1)&&(l1229>=1))&&((s1>=1)&&(l1305>=1)))) + A(((p94>=1)&&(l0>=1)) U ((s1>=1)&&(l942>=1)))) + (AX(AG...307
=> equivalent forward existential formula: ([(Init * !(EX(((s1<1)||(l1021<1)))))] = FALSE * [(FwdU(EY(((Init * !((E(TRUE U (((s1>=1)&&(l1229>=1))&&((s1>=1)...470
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, t46, t47, t48, t49,...744
Detected timeout of ITS tools.
[2024-05-21 19:38:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:38:42] [INFO ] Applying decomposition
[2024-05-21 19:38:42] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7405785067338132613.txt' '-o' '/tmp/graph7405785067338132613.bin' '-w' '/tmp/graph7405785067338132613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7405785067338132613.bin' '-l' '-1' '-v' '-w' '/tmp/graph7405785067338132613.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:38:42] [INFO ] Decomposing Gal with order
[2024-05-21 19:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:38:42] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-21 19:38:42] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:38:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 4 ms.
[2024-05-21 19:38:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4739919031833378847.gal : 3 ms
[2024-05-21 19:38:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2509883539922732612.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/CTLFireability4739919031833378847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2509883539922732612.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66968e+06,7.70712,205888,3144,2812,127185,100573,406,739687,226,1.78851e+06,0


Converting to forward existential form...Done !
original formula: (EX(((i0.u0.s1<1)||(u10.l1021<1))) * ((EF((((i0.u0.s1>=1)&&(u10.l1229>=1))&&((i0.u0.s1>=1)&&(i0.u0.l1305>=1)))) + A(((i4.u8.p94>=1)&&(i0....433
=> equivalent forward existential formula: ([(Init * !(EX(((i0.u0.s1<1)||(u10.l1021<1)))))] = FALSE * [(FwdU(EY(((Init * !((E(TRUE U (((i0.u0.s1>=1)&&(u10....620
Reverse transition relation is NOT exact ! Due to transitions t2, t38, t50, t65, t67, t68, t70, t83, t112, t134, t135, t136, t137, t138, t140, t141, t142, ...582
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 165 transition count 253
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 165 transition count 253
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 165 transition count 245
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 142 place count 133 transition count 209
Iterating global reduction 1 with 32 rules applied. Total rules applied 174 place count 133 transition count 209
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 186 place count 133 transition count 197
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 204 place count 115 transition count 169
Iterating global reduction 2 with 18 rules applied. Total rules applied 222 place count 115 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 227 place count 115 transition count 164
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 238 place count 104 transition count 144
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 104 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 253 place count 104 transition count 140
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 260 place count 97 transition count 128
Iterating global reduction 4 with 7 rules applied. Total rules applied 267 place count 97 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 97 transition count 127
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 272 place count 93 transition count 123
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 93 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 92 transition count 120
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 92 transition count 120
Applied a total of 279 rules in 15 ms. Remains 92 /216 variables (removed 124) and now considering 120/404 (removed 284) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 19:39:12] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:39:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:39:12] [INFO ] Invariant cache hit.
[2024-05-21 19:39:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 19:39:12] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 19:39:12] [INFO ] Invariant cache hit.
[2024-05-21 19:39:12] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 130 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 119/249 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 249 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 6954ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 6956ms
Starting structural reductions in LTL mode, iteration 1 : 92/216 places, 120/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7153 ms. Remains : 92/216 places, 120/404 transitions.
[2024-05-21 19:39:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:39:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:19] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-21 19:39:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18174480947567261730.gal : 1 ms
[2024-05-21 19:39:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15178131108341078225.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/CTLFireability18174480947567261730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15178131108341078225.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((EX(((AG(AX(((p124>=1)&&(l532>=1)))) * EG(((s1>=1)&&(l946>=1)))) * ((s1>=1)&&(l1221>=1)))) * AG(EF(((s1>=1)&&(l1221>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(((!(E(TRUE U !(!(EX(!(((p124>=1)&&(l532>=1)))))))) * EG(((s1>=1)&&(l946>=1)))) * ((s1>=1)&&(l12...226
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t53, t54, t56, t58, t74, t81, t82, t83, t85, t86, t...438
(forward)formula 0,0,20.3896,540392,1,0,292,2.47465e+06,267,122,3559,1.80379e+06,336
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 164 transition count 247
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 164 transition count 247
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 164 transition count 241
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 143 place count 131 transition count 204
Iterating global reduction 1 with 33 rules applied. Total rules applied 176 place count 131 transition count 204
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 188 place count 131 transition count 192
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 207 place count 112 transition count 162
Iterating global reduction 2 with 19 rules applied. Total rules applied 226 place count 112 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 232 place count 112 transition count 156
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 243 place count 101 transition count 136
Iterating global reduction 3 with 11 rules applied. Total rules applied 254 place count 101 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 101 transition count 134
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 264 place count 93 transition count 121
Iterating global reduction 4 with 8 rules applied. Total rules applied 272 place count 93 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 93 transition count 120
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 278 place count 88 transition count 115
Iterating global reduction 5 with 5 rules applied. Total rules applied 283 place count 88 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 87 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 87 transition count 110
Applied a total of 288 rules in 24 ms. Remains 87 /216 variables (removed 129) and now considering 110/404 (removed 294) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-21 19:39:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:39:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:39:40] [INFO ] Invariant cache hit.
[2024-05-21 19:39:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 19:39:40] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 19:39:40] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 19:39:40] [INFO ] Invariant cache hit.
[2024-05-21 19:39:40] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/197 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 121 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/197 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 230 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 5474ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5475ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/216 places, 110/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5689 ms. Remains : 87/216 places, 110/404 transitions.
[2024-05-21 19:39:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:39:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:39:45] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 19:39:45] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:45] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17223804083885282737.gal : 1 ms
[2024-05-21 19:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6466263399010868159.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/CTLFireability17223804083885282737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6466263399010868159.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,712808,2.72702,91756,2,13126,5,300264,6,0,458,274112,0


Converting to forward existential form...Done !
original formula: AF(((p124>=1)&&(l532>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p124>=1)&&(l532>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 106/0/4
(forward)formula 0,0,7.09745,171128,1,0,18,685033,20,4,2467,485684,16
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 170 transition count 269
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 170 transition count 269
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 99 place count 170 transition count 262
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 128 place count 141 transition count 229
Iterating global reduction 1 with 29 rules applied. Total rules applied 157 place count 141 transition count 229
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 172 place count 141 transition count 214
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 186 place count 127 transition count 195
Iterating global reduction 2 with 14 rules applied. Total rules applied 200 place count 127 transition count 195
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 205 place count 127 transition count 190
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 211 place count 121 transition count 176
Iterating global reduction 3 with 6 rules applied. Total rules applied 217 place count 121 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 121 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 222 place count 118 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 225 place count 118 transition count 171
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 115 transition count 168
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 115 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 115 transition count 167
Applied a total of 232 rules in 14 ms. Remains 115 /216 variables (removed 101) and now considering 167/404 (removed 237) transitions.
// Phase 1: matrix 167 rows 115 cols
[2024-05-21 19:39:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:39:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 19:39:53] [INFO ] Invariant cache hit.
[2024-05-21 19:39:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 19:39:53] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-21 19:39:53] [INFO ] Invariant cache hit.
[2024-05-21 19:39:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/282 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 176 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/282 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 166/342 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 342 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 13976ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13978ms
Starting structural reductions in LTL mode, iteration 1 : 115/216 places, 167/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14237 ms. Remains : 115/216 places, 167/404 transitions.
[2024-05-21 19:40:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:40:07] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-21 19:40:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:40:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:40:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12032235269919877219.gal : 1 ms
[2024-05-21 19:40:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6949877545043058465.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/CTLFireability12032235269919877219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6949877545043058465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A((!(EX(((p113>=1)&&(l431>=1)))) * (!((((EX(((s1>=1)&&(l312>=1))) * (s1>=1)) * (l1294>=1)) + (E(((s1>=1)&&(l949>=1)) U ((s1>=1)&&(l954>=1...351
=> equivalent forward existential formula: [((Init * !(EG(!(((p62>=1)&&(l0>=1)))))) * !(E(!(((p62>=1)&&(l0>=1))) U (!((!(EX(((p113>=1)&&(l431>=1)))) * (!((...541
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t29, t30, t31, t34, t35, t36, t39, t41, t51, t52, t53, t54, t55, t...687
Detected timeout of ITS tools.
[2024-05-21 19:40:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:37] [INFO ] Applying decomposition
[2024-05-21 19:40:37] [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/graph4703611842139624995.txt' '-o' '/tmp/graph4703611842139624995.bin' '-w' '/tmp/graph4703611842139624995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4703611842139624995.bin' '-l' '-1' '-v' '-w' '/tmp/graph4703611842139624995.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:40:37] [INFO ] Decomposing Gal with order
[2024-05-21 19:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:40:37] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-21 19:40:37] [INFO ] Flatten gal took : 28 ms
[2024-05-21 19:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 4 ms.
[2024-05-21 19:40:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3981425872275909338.gal : 1 ms
[2024-05-21 19:40:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12875449179856556840.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/CTLFireability3981425872275909338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12875449179856556840.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0005e+06,4.55515,115436,2001,3883,80694,74616,386,422928,270,666750,0


Converting to forward existential form...Done !
original formula: A((!(EX(((u0.p113>=1)&&(i3.u6.l431>=1)))) * (!((((EX(((u0.s1>=1)&&(i3.u7.l312>=1))) * (u0.s1>=1)) * (i6.u19.l1294>=1)) + (E(((u0.s1>=1)&&...457
=> equivalent forward existential formula: [((Init * !(EG(!(((u0.p62>=1)&&(u0.l0>=1)))))) * !(E(!(((u0.p62>=1)&&(u0.l0>=1))) U (!((!(EX(((u0.p113>=1)&&(i3....677
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t15, t51, t59, t65, t84, t92, t95, t103, t107, t108, t110, t111, t125, t126, t1...608
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 172 transition count 288
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 172 transition count 288
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 96 place count 172 transition count 280
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 123 place count 145 transition count 247
Iterating global reduction 1 with 27 rules applied. Total rules applied 150 place count 145 transition count 247
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 159 place count 145 transition count 238
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 173 place count 131 transition count 215
Iterating global reduction 2 with 14 rules applied. Total rules applied 187 place count 131 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 192 place count 131 transition count 210
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 199 place count 124 transition count 198
Iterating global reduction 3 with 7 rules applied. Total rules applied 206 place count 124 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 124 transition count 196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 212 place count 120 transition count 192
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 120 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 120 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 219 place count 118 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 118 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 117 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 117 transition count 187
Applied a total of 223 rules in 16 ms. Remains 117 /216 variables (removed 99) and now considering 187/404 (removed 217) transitions.
// Phase 1: matrix 187 rows 117 cols
[2024-05-21 19:41:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:41:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:41:07] [INFO ] Invariant cache hit.
[2024-05-21 19:41:07] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 19:41:07] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-21 19:41:07] [INFO ] Invariant cache hit.
[2024-05-21 19:41:07] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/304 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 86/205 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 206 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/304 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 86/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 186/392 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/304 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 392 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 1/1 constraints]
After SMT, in 16533ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16535ms
Starting structural reductions in LTL mode, iteration 1 : 117/216 places, 187/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16774 ms. Remains : 117/216 places, 187/404 transitions.
[2024-05-21 19:41:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:24] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-21 19:41:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8485141463451576900.gal : 1 ms
[2024-05-21 19:41:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17395388226528428874.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/CTLFireability8485141463451576900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17395388226528428874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((EX(EX(((s1>=1)&&(l1259>=1)))) * (((EX(((s1<1)||(l1024<1))) + EX(((p41<1)||(l617<1)))) + ((s1<1)||(l455<1))) + ((E(((s1>=1)&&(l1224>=1...290
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * EX(EX(((s1>=1)&&(l1259>=1)))))) * ((s1<1)||(l1024<1)))] != FALSE + [(EY((FwdU(Init,TR...726
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t30, t31, t32, t35, t36, t37, t46, t47, t48, t49, t50, t51, t52, t...774
(forward)formula 0,1,20.3971,379176,1,0,364,1.29971e+06,391,131,4626,932518,387
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 166 transition count 267
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 166 transition count 267
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 166 transition count 259
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 140 place count 134 transition count 220
Iterating global reduction 1 with 32 rules applied. Total rules applied 172 place count 134 transition count 220
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 186 place count 134 transition count 206
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 204 place count 116 transition count 177
Iterating global reduction 2 with 18 rules applied. Total rules applied 222 place count 116 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 228 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 238 place count 106 transition count 154
Iterating global reduction 3 with 10 rules applied. Total rules applied 248 place count 106 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 251 place count 106 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 257 place count 100 transition count 140
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 100 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 100 transition count 139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 97 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 97 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 97 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 96 transition count 133
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 96 transition count 133
Applied a total of 273 rules in 23 ms. Remains 96 /216 variables (removed 120) and now considering 133/404 (removed 271) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-21 19:41:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:41:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:41:44] [INFO ] Invariant cache hit.
[2024-05-21 19:41:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 19:41:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 19:41:45] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-21 19:41:45] [INFO ] Invariant cache hit.
[2024-05-21 19:41:45] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 151 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 132/283 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 283 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 7564ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 7565ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/216 places, 133/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7804 ms. Remains : 96/216 places, 133/404 transitions.
[2024-05-21 19:41:52] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:41:52] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 19:41:52] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:41:52] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12034897666550255946.gal : 1 ms
[2024-05-21 19:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16202787538829457176.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/CTLFireability12034897666550255946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16202787538829457176.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((AF((EG(((s1>=1)&&(l1019>=1))) + EF(((s1>=1)&&(l606>=1))))) * (s1>=1)) * ((l1291>=1)&&(l947>=1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((l1291>=1)&&(l947>=1))) * (s1>=1)) * !(EG(!((EG(((s1>=1)&&(l1019>=1))) + E(TRUE U ((s1>=1...184
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t40, t41, t42, t43, t44, t45, t51, t52, t53, t54, t58, t61, t70, t...516
Using saturation style SCC detection
(forward)formula 0,1,21.3879,587148,1,0,455,3.11288e+06,302,208,3730,2.35713e+06,515
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 173 transition count 292
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 173 transition count 292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 94 place count 173 transition count 284
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 122 place count 145 transition count 252
Iterating global reduction 1 with 28 rules applied. Total rules applied 150 place count 145 transition count 252
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 164 place count 145 transition count 238
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 178 place count 131 transition count 214
Iterating global reduction 2 with 14 rules applied. Total rules applied 192 place count 131 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 197 place count 131 transition count 209
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 123 transition count 197
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 123 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 123 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 219 place count 119 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 119 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 119 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 226 place count 117 transition count 188
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 117 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 116 transition count 186
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 116 transition count 186
Applied a total of 230 rules in 16 ms. Remains 116 /216 variables (removed 100) and now considering 186/404 (removed 218) transitions.
// Phase 1: matrix 186 rows 116 cols
[2024-05-21 19:42:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:42:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:42:14] [INFO ] Invariant cache hit.
[2024-05-21 19:42:14] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 19:42:14] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 19:42:14] [INFO ] Invariant cache hit.
[2024-05-21 19:42:14] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/302 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 83/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 201 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/302 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 83/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 185/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 386 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 14809ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14811ms
Starting structural reductions in LTL mode, iteration 1 : 116/216 places, 186/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15090 ms. Remains : 116/216 places, 186/404 transitions.
[2024-05-21 19:42:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:42:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:42:29] [INFO ] Input system was already deterministic with 186 transitions.
[2024-05-21 19:42:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1259971532330911982.gal : 1 ms
[2024-05-21 19:42:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13323967917428672576.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/CTLFireability1259971532330911982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13323967917428672576.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(E(((!(EX(((s1>=1)&&(l608>=1)))) + EF(EX(!(((s1<1)||(l1024<1)))))) + ((s1>=1)&&(l610>=1))) U EF(((s1>=1)&&(l1241>=1)))) U !(((((p11>=1)&...329
=> equivalent forward existential formula: [((Init * !(EG(!(!(((((p11>=1)&&(l0>=1)) + !(EX(((s1>=1)&&(l296>=1))))) + !((E(!(((!(EG(!(((s1>=1)&&(l400>=1))))...1545
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t15, t21, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...773
Detected timeout of ITS tools.
[2024-05-21 19:42:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:59] [INFO ] Applying decomposition
[2024-05-21 19:42:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3246872523142325920.txt' '-o' '/tmp/graph3246872523142325920.bin' '-w' '/tmp/graph3246872523142325920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3246872523142325920.bin' '-l' '-1' '-v' '-w' '/tmp/graph3246872523142325920.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:42:59] [INFO ] Decomposing Gal with order
[2024-05-21 19:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:42:59] [INFO ] Removed a total of 165 redundant transitions.
[2024-05-21 19:42:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 5 ms.
[2024-05-21 19:42:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16727792212903714981.gal : 2 ms
[2024-05-21 19:42:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2890204950915548797.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/CTLFireability16727792212903714981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2890204950915548797.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.78384e+06,27.3502,669804,3579,3565,307809,105037,465,6.65897e+06,223,950832,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 404/404 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 167 transition count 269
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 167 transition count 269
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 108 place count 167 transition count 259
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 141 place count 134 transition count 221
Iterating global reduction 1 with 33 rules applied. Total rules applied 174 place count 134 transition count 221
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 191 place count 134 transition count 204
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 210 place count 115 transition count 174
Iterating global reduction 2 with 19 rules applied. Total rules applied 229 place count 115 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 235 place count 115 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 246 place count 104 transition count 148
Iterating global reduction 3 with 11 rules applied. Total rules applied 257 place count 104 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 261 place count 104 transition count 144
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 268 place count 97 transition count 132
Iterating global reduction 4 with 7 rules applied. Total rules applied 275 place count 97 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 97 transition count 131
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 281 place count 92 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 286 place count 92 transition count 126
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 92 transition count 124
Applied a total of 288 rules in 13 ms. Remains 92 /216 variables (removed 124) and now considering 124/404 (removed 280) transitions.
// Phase 1: matrix 124 rows 92 cols
[2024-05-21 19:43:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:43:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:43:29] [INFO ] Invariant cache hit.
[2024-05-21 19:43:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 19:43:29] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-21 19:43:29] [INFO ] Invariant cache hit.
[2024-05-21 19:43:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/216 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 140 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/216 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 123/263 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 263 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4814 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 7338ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 7339ms
Starting structural reductions in LTL mode, iteration 1 : 92/216 places, 124/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7552 ms. Remains : 92/216 places, 124/404 transitions.
[2024-05-21 19:43:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:43:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:43:37] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-21 19:43:37] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:43:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:43:37] [INFO ] Time to serialize gal into /tmp/CTLFireability891435577730550594.gal : 1 ms
[2024-05-21 19:43:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11907879249122509211.ctl : 7 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/CTLFireability891435577730550594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11907879249122509211.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,555522,2.38822,83476,2,15453,5,250557,6,0,492,248828,0


Converting to forward existential form...Done !
original formula: E((!(((p91>=1)&&(l0>=1))) + AG(AX(!(((s1>=1)&&(l608>=1)))))) U (AG(((s1>=1)&&(l606>=1))) + ((p49>=1)&&(l621>=1))))
=> equivalent forward existential formula: ([(FwdU(Init,(!(((p91>=1)&&(l0>=1))) + !(E(TRUE U !(!(EX(!(!(((s1>=1)&&(l608>=1))))))))))) * !(E(TRUE U !(((s1>=...311
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t29, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...502
(forward)formula 0,1,19.1784,533580,1,0,509,2.14781e+06,278,272,3407,2.34358e+06,560
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 19:43:56] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:43:56] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:43:56] [INFO ] Applying decomposition
[2024-05-21 19:43:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15660586056662744741.txt' '-o' '/tmp/graph15660586056662744741.bin' '-w' '/tmp/graph15660586056662744741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15660586056662744741.bin' '-l' '-1' '-v' '-w' '/tmp/graph15660586056662744741.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:43:56] [INFO ] Decomposing Gal with order
[2024-05-21 19:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:43:56] [INFO ] Removed a total of 517 redundant transitions.
[2024-05-21 19:43:56] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:43:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 9 ms.
[2024-05-21 19:43:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16097602233194216947.gal : 3 ms
[2024-05-21 19:43:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3676874958904970859.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/CTLFireability16097602233194216947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3676874958904970859.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.81494e+07,360.246,8121732,15578,10487,1.527e+06,344511,789,9.76265e+07,391,9.94829e+06,0


Converting to forward existential form...Done !
original formula: (EX(((i0.u0.s1<1)||(i6.u17.l1021<1))) * ((EF((((i0.u0.s1>=1)&&(i5.u22.l1229>=1))&&((i0.u0.s1>=1)&&(i7.u29.l1305>=1)))) + A(((i1.u15.p94>=...446
=> equivalent forward existential formula: ([(Init * !(EX(((i0.u0.s1<1)||(i6.u17.l1021<1)))))] = FALSE * [(FwdU(EY(((Init * !((E(TRUE U (((i0.u0.s1>=1)&&(i...635
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t9, t11, t17, t22, t23, t29, t30, t49, t54, t63, t80, t81, t83, t86, t102, t1...1242
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,557.638,8127112,1,0,3.36912e+06,1.10683e+06,3662,9.76265e+07,2227,2.51369e+07,6416922
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((!(EX(((i7.u21.p113>=1)&&(i5.u22.l431>=1)))) * (!((((EX(((i0.u0.s1>=1)&&(i3.u6.l312>=1))) * (i0.u0.s1>=1)) * (i6.u28.l1294>=1)) + (E(((...504
=> equivalent forward existential formula: [((Init * !(EG(!(((i3.u6.p62>=1)&&(i1.u1.l0>=1)))))) * !(E(!(((i3.u6.p62>=1)&&(i1.u1.l0>=1))) U (!((!(EX(((i7.u2...744
(forward)formula 1,0,862.505,9586008,1,0,5.1547e+06,1.30082e+06,1967,9.76265e+07,1214,2.80493e+07,969655
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(E(((!(EX(((i0.u0.s1>=1)&&(i3.u6.l608>=1)))) + EF(EX(!(((i0.u0.s1<1)||(i6.u16.l1024<1)))))) + ((i0.u0.s1>=1)&&(i3.u4.l610>=1))) U EF(((i...465
=> equivalent forward existential formula: [((Init * !(EG(!(!(((((i3.u4.p11>=1)&&(i1.u1.l0>=1)) + !(EX(((i0.u0.s1>=1)&&(i3.u4.l296>=1))))) + !((E(!(((!(EG(...2153
(forward)formula 2,0,1068.99,9586008,1,0,5.1547e+06,1.30082e+06,2128,9.76265e+07,1241,2.80493e+07,5343298
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1716321708248

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

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