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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 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 1.6M 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-d2m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716325604238

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:06:45] [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 21:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:06:45] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-21 21:06:45] [INFO ] Transformed 4763 places.
[2024-05-21 21:06:45] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:06:45] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 69 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 603 place count 779 transition count 1536
Iterating global reduction 1 with 358 rules applied. Total rules applied 961 place count 779 transition count 1536
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 1025 place count 779 transition count 1472
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1305 place count 499 transition count 1192
Iterating global reduction 2 with 280 rules applied. Total rules applied 1585 place count 499 transition count 1192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1591 place count 499 transition count 1186
Discarding 197 places :
Symmetric choice reduction at 3 with 197 rule applications. Total rules 1788 place count 302 transition count 914
Iterating global reduction 3 with 197 rules applied. Total rules applied 1985 place count 302 transition count 914
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 3 with 258 rules applied. Total rules applied 2243 place count 302 transition count 656
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2254 place count 291 transition count 638
Iterating global reduction 4 with 11 rules applied. Total rules applied 2265 place count 291 transition count 638
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 2273 place count 283 transition count 630
Iterating global reduction 4 with 8 rules applied. Total rules applied 2281 place count 283 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2282 place count 283 transition count 629
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2289 place count 276 transition count 622
Iterating global reduction 5 with 7 rules applied. Total rules applied 2296 place count 276 transition count 622
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2308 place count 276 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2309 place count 275 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 2310 place count 275 transition count 608
Applied a total of 2310 rules in 216 ms. Remains 275 /1183 variables (removed 908) and now considering 608/2478 (removed 1870) transitions.
// Phase 1: matrix 608 rows 275 cols
[2024-05-21 21:06:46] [INFO ] Computed 2 invariants in 26 ms
[2024-05-21 21:06:46] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-21 21:06:46] [INFO ] Invariant cache hit.
[2024-05-21 21:06:46] [INFO ] State equation strengthened by 349 read => feed constraints.
[2024-05-21 21:06:47] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2024-05-21 21:06:47] [INFO ] Invariant cache hit.
[2024-05-21 21:06:47] [INFO ] State equation strengthened by 349 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 608/883 variables, 275/277 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 349/626 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 883/883 variables, and 626 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, ReadFeed: 349/349 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 608/883 variables, 275/277 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 349/626 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 607/1233 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)timeout

(s99 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/883 variables, and 1233 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, ReadFeed: 349/349 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints]
After SMT, in 62209ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 62230ms
Starting structural reductions in LTL mode, iteration 1 : 275/1183 places, 608/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63899 ms. Remains : 275/1183 places, 608/2478 transitions.
Support contains 69 out of 275 places after structural reductions.
[2024-05-21 21:07:49] [INFO ] Flatten gal took : 62 ms
[2024-05-21 21:07:50] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:07:50] [INFO ] Input system was already deterministic with 608 transitions.
Reduction of identical properties reduced properties to check from 56 to 55
RANDOM walk for 40000 steps (9198 resets) in 2949 ms. (13 steps per ms) remains 50/55 properties
BEST_FIRST walk for 4001 steps (184 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (190 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (164 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (379 resets) in 53 ms. (74 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (167 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (383 resets) in 42 ms. (93 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (178 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (181 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (170 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (364 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (189 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (173 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (800 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (175 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (164 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (184 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (176 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (156 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (172 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (170 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (187 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (163 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (171 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (188 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (401 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (383 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (167 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (155 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (148 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (171 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (171 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (173 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (200 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (187 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (169 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (375 resets) in 47 ms. (83 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (179 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (184 resets) in 27 ms. (143 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (364 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (165 resets) in 39 ms. (100 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (203 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (395 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (407 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (177 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (181 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (184 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (157 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (180 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (181 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
Probably explored full state space saw : 134433 states, properties seen :48
Probabilistic random walk after 355063 steps, saw 134433 distinct states, run finished after 2000 ms. (steps per millisecond=177 ) properties seen :48
Explored full state space saw : 134736 states, properties seen :0
Exhaustive walk after 355368 steps, saw 134736 distinct states, run finished after 1381 ms. (steps per millisecond=257 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:07:54] [INFO ] Flatten gal took : 26 ms
[2024-05-21 21:07:55] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:07:55] [INFO ] Input system was already deterministic with 608 transitions.
Computed a total of 5 stabilizing places and 43 stable transitions
Graph (complete) has 1154 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 235 transition count 453
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 235 transition count 453
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 235 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 121 place count 201 transition count 401
Iterating global reduction 1 with 34 rules applied. Total rules applied 155 place count 201 transition count 401
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 177 place count 201 transition count 379
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 202 place count 176 transition count 334
Iterating global reduction 2 with 25 rules applied. Total rules applied 227 place count 176 transition count 334
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 243 place count 176 transition count 318
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 255 place count 164 transition count 293
Iterating global reduction 3 with 12 rules applied. Total rules applied 267 place count 164 transition count 293
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 277 place count 164 transition count 283
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 282 place count 159 transition count 278
Iterating global reduction 4 with 5 rules applied. Total rules applied 287 place count 159 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 290 place count 159 transition count 275
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 292 place count 157 transition count 272
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 157 transition count 272
Applied a total of 294 rules in 42 ms. Remains 157 /275 variables (removed 118) and now considering 272/608 (removed 336) transitions.
// Phase 1: matrix 272 rows 157 cols
[2024-05-21 21:07:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:07:55] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 21:07:55] [INFO ] Invariant cache hit.
[2024-05-21 21:07:55] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 21:07:55] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-21 21:07:55] [INFO ] Invariant cache hit.
[2024-05-21 21:07:55] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/429 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 125/284 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 284 constraints, problems are : Problem set: 0 solved, 271 unsolved in 10586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/429 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 125/284 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 271/555 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 555 constraints, problems are : Problem set: 0 solved, 271 unsolved in 22118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 33231ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 33244ms
Starting structural reductions in LTL mode, iteration 1 : 157/275 places, 272/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33992 ms. Remains : 157/275 places, 272/608 transitions.
[2024-05-21 21:08:29] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:08:29] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:08:29] [INFO ] Input system was already deterministic with 272 transitions.
[2024-05-21 21:08:29] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:08:29] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:08:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9437009275362054225.gal : 7 ms
[2024-05-21 21:08:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16182326903419169947.ctl : 6 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/CTLFireability9437009275362054225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16182326903419169947.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,42632,2.28234,80136,2,11113,5,186167,6,0,900,189339,0


Converting to forward existential form...Done !
original formula: EF(((!(A(!(((A(((s1>=1)&&(l3092>=1)) U ((s1>=1)&&(l3086>=1))) + ((s1>=1)&&(l3075>=1))) + ((s1>=1)&&(l4114>=1)))) U ((s1>=1)&&(l3689>=1)))...300
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (((s1<1)||(l1641<1))||(((s1>=1)&&(l2776>=1))&&((l4156>=1)&&((s1<1)||(l2836<1)))))) * !(!(...897
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t26, t31, t74, t75, t76, t77, t78, t79, t80,...1068
(forward)formula 0,1,13.2024,371516,1,0,826,1.90978e+06,582,350,6394,907197,947
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 233 transition count 427
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 233 transition count 427
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 233 transition count 421
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 125 place count 198 transition count 377
Iterating global reduction 1 with 35 rules applied. Total rules applied 160 place count 198 transition count 377
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 179 place count 198 transition count 358
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 204 place count 173 transition count 317
Iterating global reduction 2 with 25 rules applied. Total rules applied 229 place count 173 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 240 place count 173 transition count 306
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 251 place count 162 transition count 284
Iterating global reduction 3 with 11 rules applied. Total rules applied 262 place count 162 transition count 284
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 277 place count 162 transition count 269
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 282 place count 157 transition count 264
Iterating global reduction 4 with 5 rules applied. Total rules applied 287 place count 157 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 289 place count 157 transition count 262
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 292 place count 154 transition count 258
Iterating global reduction 5 with 3 rules applied. Total rules applied 295 place count 154 transition count 258
Applied a total of 295 rules in 65 ms. Remains 154 /275 variables (removed 121) and now considering 258/608 (removed 350) transitions.
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:08:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:08:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 21:08:42] [INFO ] Invariant cache hit.
[2024-05-21 21:08:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-21 21:08:43] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-21 21:08:43] [INFO ] Redundant transitions in 10 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 21:08:43] [INFO ] Invariant cache hit.
[2024-05-21 21:08:43] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/412 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 110/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/412 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 266 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/412 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 110/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 257/523 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/412 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 523 constraints, problems are : Problem set: 0 solved, 257 unsolved in 19118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 29704ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 29707ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/275 places, 258/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30290 ms. Remains : 154/275 places, 258/608 transitions.
[2024-05-21 21:09:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:09:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:09:12] [INFO ] Input system was already deterministic with 258 transitions.
[2024-05-21 21:09:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:09:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:09:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6228885493993030544.gal : 3 ms
[2024-05-21 21:09:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1053490078377443228.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/CTLFireability6228885493993030544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1053490078377443228.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,48673,3.40901,103208,2,11990,5,248423,6,0,874,271759,0


Converting to forward existential form...Done !
original formula: (EF(((((s1>=1)&&(l4120>=1))||((s1>=1)&&(l4193>=1)))||(((p184>=1)&&(l0>=1))||((p91>=1)&&(l0>=1))))) + ((EF(((s1<1)||(l3662<1))) * E(((s1>=...262
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((((s1>=1)&&(l4120>=1))||((s1>=1)&&(l4193>=1)))||(((p184>=1)&&(l0>=1))||((p91>=1)&&(l0>=1))...442
(forward)formula 0,1,3.4166,103208,1,0,7,248423,8,1,888,271759,1
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 226 transition count 401
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 226 transition count 401
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 105 place count 226 transition count 394
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 146 place count 185 transition count 340
Iterating global reduction 1 with 41 rules applied. Total rules applied 187 place count 185 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 208 place count 185 transition count 319
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 238 place count 155 transition count 266
Iterating global reduction 2 with 30 rules applied. Total rules applied 268 place count 155 transition count 266
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 282 place count 155 transition count 252
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 299 place count 138 transition count 199
Iterating global reduction 3 with 17 rules applied. Total rules applied 316 place count 138 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 322 place count 138 transition count 193
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 330 place count 130 transition count 185
Iterating global reduction 4 with 8 rules applied. Total rules applied 338 place count 130 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 342 place count 130 transition count 181
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 346 place count 126 transition count 176
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 126 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 126 transition count 175
Applied a total of 351 rules in 38 ms. Remains 126 /275 variables (removed 149) and now considering 175/608 (removed 433) transitions.
// Phase 1: matrix 175 rows 126 cols
[2024-05-21 21:09:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:09:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:09:16] [INFO ] Invariant cache hit.
[2024-05-21 21:09:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:09:16] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 21:09:16] [INFO ] Redundant transitions in 2 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 21:09:16] [INFO ] Invariant cache hit.
[2024-05-21 21:09:16] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/301 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 11 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 185 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/301 variables, 126/130 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 55/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 174/359 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 359 constraints, problems are : Problem set: 0 solved, 174 unsolved in 10814 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
After SMT, in 17394ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 17396ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/275 places, 175/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17744 ms. Remains : 126/275 places, 175/608 transitions.
[2024-05-21 21:09:34] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:09:34] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:09:34] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-21 21:09:34] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (9218 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2024-05-21 21:09:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:09:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12412458206761145639.gal : 2 ms
[2024-05-21 21:09:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8636898334829464514.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12412458206761145639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8636898334829464514.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (1791 resets) in 46 ms. (851 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8636898334829464514.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 118
Finished probabilistic random walk after 31932 steps, run visited all 1 properties in 49 ms. (steps per millisecond=651 )
Probabilistic random walk after 31932 steps, saw 14185 distinct states, run finished after 53 ms. (steps per millisecond=602 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 228 transition count 415
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 228 transition count 415
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 101 place count 228 transition count 408
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 140 place count 189 transition count 356
Iterating global reduction 1 with 39 rules applied. Total rules applied 179 place count 189 transition count 356
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 200 place count 189 transition count 335
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 229 place count 160 transition count 283
Iterating global reduction 2 with 29 rules applied. Total rules applied 258 place count 160 transition count 283
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 272 place count 160 transition count 269
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 288 place count 144 transition count 218
Iterating global reduction 3 with 16 rules applied. Total rules applied 304 place count 144 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 311 place count 144 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 317 place count 138 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 323 place count 138 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 327 place count 138 transition count 201
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 329 place count 136 transition count 198
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 136 transition count 198
Applied a total of 331 rules in 13 ms. Remains 136 /275 variables (removed 139) and now considering 198/608 (removed 410) transitions.
// Phase 1: matrix 198 rows 136 cols
[2024-05-21 21:09:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:09:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 21:09:34] [INFO ] Invariant cache hit.
[2024-05-21 21:09:34] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:09:34] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-21 21:09:34] [INFO ] Invariant cache hit.
[2024-05-21 21:09:34] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/334 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 208 constraints, problems are : Problem set: 0 solved, 197 unsolved in 5631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/334 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 197/405 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 405 constraints, problems are : Problem set: 0 solved, 197 unsolved in 13820 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints]
After SMT, in 19723ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 19726ms
Starting structural reductions in LTL mode, iteration 1 : 136/275 places, 198/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20174 ms. Remains : 136/275 places, 198/608 transitions.
[2024-05-21 21:09:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:09:54] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:09:54] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-21 21:09:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:09:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:09:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18140636973586906320.gal : 2 ms
[2024-05-21 21:09:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8881402501109331289.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/CTLFireability18140636973586906320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8881402501109331289.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,33545,1.32012,50456,2,7117,5,131206,6,0,742,114375,0


Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l4272>=1)) U AX(AF(AX(((s1>=1)&&(l4270>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(EG(!(!(EX(!(((s1>=1)&&(l4270>=1))))))))))))))) * !(E(!(!(EX(!(!(EG(!(!(EX(!(((s1>=1)&&...275
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t93, t97, t100, ...681
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.24029,150060,1,0,405,628700,426,176,5339,324020,478
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 231 transition count 433
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 231 transition count 433
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 231 transition count 426
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 135 place count 191 transition count 373
Iterating global reduction 1 with 40 rules applied. Total rules applied 175 place count 191 transition count 373
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 198 place count 191 transition count 350
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 228 place count 161 transition count 297
Iterating global reduction 2 with 30 rules applied. Total rules applied 258 place count 161 transition count 297
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 273 place count 161 transition count 282
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 289 place count 145 transition count 240
Iterating global reduction 3 with 16 rules applied. Total rules applied 305 place count 145 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 312 place count 145 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 319 place count 138 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 326 place count 138 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 330 place count 138 transition count 222
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 333 place count 135 transition count 218
Iterating global reduction 5 with 3 rules applied. Total rules applied 336 place count 135 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 135 transition count 217
Applied a total of 337 rules in 19 ms. Remains 135 /275 variables (removed 140) and now considering 217/608 (removed 391) transitions.
// Phase 1: matrix 217 rows 135 cols
[2024-05-21 21:09:59] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:09:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:09:59] [INFO ] Invariant cache hit.
[2024-05-21 21:09:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 21:10:00] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-21 21:10:00] [INFO ] Invariant cache hit.
[2024-05-21 21:10:00] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/352 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 90/227 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 21:10:04] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 228 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/352 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 216/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 444 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 1/1 constraints]
After SMT, in 24193ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 24197ms
Starting structural reductions in LTL mode, iteration 1 : 135/275 places, 217/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24630 ms. Remains : 135/275 places, 217/608 transitions.
[2024-05-21 21:10:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:10:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:10:24] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-21 21:10:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:10:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:10:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6485708667648733986.gal : 2 ms
[2024-05-21 21:10:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10184495901279949318.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/CTLFireability6485708667648733986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10184495901279949318.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,31018,1.21182,44512,2,7015,5,115109,6,0,757,110305,0


Converting to forward existential form...Done !
original formula: AG(AF((((s2>=1)&&(l4193>=1)) + (AX(((s1<1)||(l1727<1))) * E(A(((s1>=1)&&(l3080>=1)) U ((s1>=1)&&(l3086>=1))) U AF(((s1>=1)&&(l4129>=1))))...159
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((s2>=1)&&(l4193>=1)) + (!(EX(!(((s1<1)||(l1727<1))))) * E(!((E(!(((s1>=1)&&(l3086>=1))...294
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t69, t70, t74, t75, t76, t84, t85, t86, t87, t88, t89, t90, t91, t...819
(forward)formula 0,0,6.60957,198708,1,0,577,1.01344e+06,477,242,5378,480758,706
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 227 transition count 403
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 227 transition count 403
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 227 transition count 396
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 143 place count 187 transition count 344
Iterating global reduction 1 with 40 rules applied. Total rules applied 183 place count 187 transition count 344
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 203 place count 187 transition count 324
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 234 place count 156 transition count 270
Iterating global reduction 2 with 31 rules applied. Total rules applied 265 place count 156 transition count 270
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 279 place count 156 transition count 256
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 297 place count 138 transition count 201
Iterating global reduction 3 with 18 rules applied. Total rules applied 315 place count 138 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 322 place count 138 transition count 194
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 330 place count 130 transition count 186
Iterating global reduction 4 with 8 rules applied. Total rules applied 338 place count 130 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 342 place count 130 transition count 182
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 346 place count 126 transition count 177
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 126 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 126 transition count 176
Applied a total of 351 rules in 24 ms. Remains 126 /275 variables (removed 149) and now considering 176/608 (removed 432) transitions.
// Phase 1: matrix 176 rows 126 cols
[2024-05-21 21:10:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:10:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:10:31] [INFO ] Invariant cache hit.
[2024-05-21 21:10:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:10:31] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 21:10:31] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 21:10:31] [INFO ] Invariant cache hit.
[2024-05-21 21:10:31] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 15513ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 15515ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/275 places, 176/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15833 ms. Remains : 126/275 places, 176/608 transitions.
[2024-05-21 21:10:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:10:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:10:46] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-21 21:10:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:10:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:10:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15315820869934264624.gal : 14 ms
[2024-05-21 21:10:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1336419090215829142.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15315820869934264624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1336419090215829142.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1336419090215829142.prop.
RANDOM walk for 40000 steps (9167 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1772 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 118
Finished probabilistic random walk after 34536 steps, run visited all 1 properties in 90 ms. (steps per millisecond=383 )
Probabilistic random walk after 34536 steps, saw 15315 distinct states, run finished after 91 ms. (steps per millisecond=379 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 232 transition count 434
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 232 transition count 434
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 232 transition count 427
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 128 place count 197 transition count 380
Iterating global reduction 1 with 35 rules applied. Total rules applied 163 place count 197 transition count 380
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 183 place count 197 transition count 360
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 209 place count 171 transition count 312
Iterating global reduction 2 with 26 rules applied. Total rules applied 235 place count 171 transition count 312
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 247 place count 171 transition count 300
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 261 place count 157 transition count 262
Iterating global reduction 3 with 14 rules applied. Total rules applied 275 place count 157 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 283 place count 157 transition count 254
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 289 place count 151 transition count 248
Iterating global reduction 4 with 6 rules applied. Total rules applied 295 place count 151 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 299 place count 151 transition count 244
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 301 place count 149 transition count 241
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 149 transition count 241
Applied a total of 303 rules in 10 ms. Remains 149 /275 variables (removed 126) and now considering 241/608 (removed 367) transitions.
// Phase 1: matrix 241 rows 149 cols
[2024-05-21 21:10:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:10:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:10:47] [INFO ] Invariant cache hit.
[2024-05-21 21:10:47] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:10:47] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-21 21:10:47] [INFO ] Invariant cache hit.
[2024-05-21 21:10:47] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/390 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 101/252 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 252 constraints, problems are : Problem set: 0 solved, 240 unsolved in 9834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/390 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 101/252 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 240/492 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 492 constraints, problems are : Problem set: 0 solved, 240 unsolved in 19050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 29239ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 29243ms
Starting structural reductions in LTL mode, iteration 1 : 149/275 places, 241/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29673 ms. Remains : 149/275 places, 241/608 transitions.
[2024-05-21 21:11:16] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:11:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:11:16] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-21 21:11:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:11:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9654945104245163647.gal : 1 ms
[2024-05-21 21:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6499500143967062173.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/CTLFireability9654945104245163647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6499500143967062173.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,39208,1.71178,64536,2,9280,5,167623,6,0,837,152034,0


Converting to forward existential form...Done !
original formula: AX(EG((((EX(EG(((s1<1)||(l2590<1)))) + !(A(((s1>=1)&&(l3838>=1)) U ((s1>=1)&&(l3844>=1))))) + (AF(((s1<1)||(l4111<1))) + ((s1>=1)&&(l4150...189
=> equivalent forward existential formula: [(EY(Init) * !(EG((((EX(EG(((s1<1)||(l2590<1)))) + !(!((E(!(((s1>=1)&&(l3844>=1))) U (!(((s1>=1)&&(l3838>=1))) *...313
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t17, t69, t71, t72, t73, t77, t78, t79, t80, t81, t83, t84, t85, t86, t...863
(forward)formula 0,1,8.69929,269244,1,0,642,1.23479e+06,528,269,6006,658550,780
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 228 transition count 423
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 228 transition count 423
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 104 place count 228 transition count 413
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 145 place count 187 transition count 359
Iterating global reduction 1 with 41 rules applied. Total rules applied 186 place count 187 transition count 359
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 209 place count 187 transition count 336
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 239 place count 157 transition count 287
Iterating global reduction 2 with 30 rules applied. Total rules applied 269 place count 157 transition count 287
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 284 place count 157 transition count 272
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 302 place count 139 transition count 217
Iterating global reduction 3 with 18 rules applied. Total rules applied 320 place count 139 transition count 217
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 327 place count 139 transition count 210
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 335 place count 131 transition count 202
Iterating global reduction 4 with 8 rules applied. Total rules applied 343 place count 131 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 347 place count 131 transition count 198
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 351 place count 127 transition count 193
Iterating global reduction 5 with 4 rules applied. Total rules applied 355 place count 127 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 127 transition count 192
Applied a total of 356 rules in 25 ms. Remains 127 /275 variables (removed 148) and now considering 192/608 (removed 416) transitions.
// Phase 1: matrix 192 rows 127 cols
[2024-05-21 21:11:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:11:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 21:11:25] [INFO ] Invariant cache hit.
[2024-05-21 21:11:25] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:11:26] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-21 21:11:26] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 21:11:26] [INFO ] Invariant cache hit.
[2024-05-21 21:11:26] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/319 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 202 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/319 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 191/393 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 393 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18785ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18787ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/275 places, 192/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19161 ms. Remains : 127/275 places, 192/608 transitions.
[2024-05-21 21:11:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:11:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:11:44] [INFO ] Input system was already deterministic with 192 transitions.
[2024-05-21 21:11:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:11:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9841716870133557402.gal : 1 ms
[2024-05-21 21:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability788049206091307615.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/CTLFireability9841716870133557402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability788049206091307615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24174,0.682205,31852,2,5850,5,84458,6,0,700,71843,0


Converting to forward existential form...Done !
original formula: AF(AG((AF(((s1<1)||(l3088<1))) * EF(!(E(((s1>=1)&&(l3089>=1)) U ((s1>=1)&&(l3077>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(EG(!(((s1<1)||(l3088<1))))) * E(TRUE U !(E(((s1>=1)&&(l3089>=1)) U ((s1>=1)&&(l3077...178
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t91, t...668
(forward)formula 0,1,2.40531,80600,1,0,347,286120,421,137,4979,142261,438
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 230 transition count 421
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 230 transition count 421
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 98 place count 230 transition count 413
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 136 place count 192 transition count 363
Iterating global reduction 1 with 38 rules applied. Total rules applied 174 place count 192 transition count 363
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 190 place count 192 transition count 347
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 218 place count 164 transition count 300
Iterating global reduction 2 with 28 rules applied. Total rules applied 246 place count 164 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 261 place count 164 transition count 285
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 274 place count 151 transition count 257
Iterating global reduction 3 with 13 rules applied. Total rules applied 287 place count 151 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 292 place count 151 transition count 252
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 300 place count 143 transition count 244
Iterating global reduction 4 with 8 rules applied. Total rules applied 308 place count 143 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 312 place count 143 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 316 place count 139 transition count 235
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 139 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 321 place count 139 transition count 234
Applied a total of 321 rules in 18 ms. Remains 139 /275 variables (removed 136) and now considering 234/608 (removed 374) transitions.
// Phase 1: matrix 234 rows 139 cols
[2024-05-21 21:11:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:11:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:11:47] [INFO ] Invariant cache hit.
[2024-05-21 21:11:47] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-21 21:11:47] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 21:11:47] [INFO ] Invariant cache hit.
[2024-05-21 21:11:47] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/373 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 106/247 constraints. Problems are: Problem set: 0 solved, 233 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 247 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/373 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 106/247 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 233/480 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 480 constraints, problems are : Problem set: 0 solved, 233 unsolved in 17229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 25134ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 25138ms
Starting structural reductions in LTL mode, iteration 1 : 139/275 places, 234/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25531 ms. Remains : 139/275 places, 234/608 transitions.
[2024-05-21 21:12:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:12:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:12:12] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-21 21:12:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:12:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:12:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1673704277732771334.gal : 2 ms
[2024-05-21 21:12:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17629255409990501544.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/CTLFireability1673704277732771334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17629255409990501544.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,28678,1.06631,42224,2,7139,5,108607,6,0,790,98190,0


Converting to forward existential form...Done !
original formula: EG(E(AG(A(!(((s1>=1)&&(l3839>=1))) U ((p75>=1)&&(l0>=1)))) U ((EG(!(((p211>=1)&&(l0>=1)))) * !(EX(((s1>=1)&&(l3846>=1))))) * ((s1>=1)&&(l...167
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !(!((E(!(((p75>=1)&&(l0>=1))) U (!(!(((s1>=1)&&(l3839>=1)))) * !(((p75>=1)&&(l0>=1))))) ...289
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t72, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t...799
(forward)formula 0,0,6.25622,193324,1,0,657,958533,514,299,5670,464911,855
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 227 transition count 414
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 227 transition count 414
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 227 transition count 407
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 144 place count 186 transition count 353
Iterating global reduction 1 with 41 rules applied. Total rules applied 185 place count 186 transition count 353
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 207 place count 186 transition count 331
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 238 place count 155 transition count 277
Iterating global reduction 2 with 31 rules applied. Total rules applied 269 place count 155 transition count 277
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 287 place count 155 transition count 259
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 305 place count 137 transition count 204
Iterating global reduction 3 with 18 rules applied. Total rules applied 323 place count 137 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 330 place count 137 transition count 197
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 338 place count 129 transition count 189
Iterating global reduction 4 with 8 rules applied. Total rules applied 346 place count 129 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 350 place count 129 transition count 185
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 354 place count 125 transition count 180
Iterating global reduction 5 with 4 rules applied. Total rules applied 358 place count 125 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 125 transition count 179
Applied a total of 359 rules in 8 ms. Remains 125 /275 variables (removed 150) and now considering 179/608 (removed 429) transitions.
// Phase 1: matrix 179 rows 125 cols
[2024-05-21 21:12:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:12:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 21:12:19] [INFO ] Invariant cache hit.
[2024-05-21 21:12:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:12:19] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 21:12:19] [INFO ] Invariant cache hit.
[2024-05-21 21:12:19] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 188 constraints, problems are : Problem set: 0 solved, 178 unsolved in 6264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/304 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 178/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/304 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 366 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints]
After SMT, in 17523ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 17527ms
Starting structural reductions in LTL mode, iteration 1 : 125/275 places, 179/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17847 ms. Remains : 125/275 places, 179/608 transitions.
[2024-05-21 21:12:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:12:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:12:37] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-21 21:12:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:12:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:12:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17199634423443089885.gal : 1 ms
[2024-05-21 21:12:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14816432052988202821.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/CTLFireability17199634423443089885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14816432052988202821.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,23814,0.670127,31380,2,5756,5,80405,6,0,679,70362,0


Converting to forward existential form...Done !
original formula: EG((AF(((s1<1)||(l3656<1))) + EX(((s1>=1)&&(l3083>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((s1<1)||(l3656<1))))) + EX(((s1>=1)&&(l3083>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t84, t85, t86, t87, t88, t89, t90, t91, t...597
(forward)formula 0,1,2.85429,96788,1,0,337,322624,384,135,4818,202268,410
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 232 transition count 413
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 232 transition count 413
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 232 transition count 407
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 127 place count 197 transition count 363
Iterating global reduction 1 with 35 rules applied. Total rules applied 162 place count 197 transition count 363
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 182 place count 197 transition count 343
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 207 place count 172 transition count 296
Iterating global reduction 2 with 25 rules applied. Total rules applied 232 place count 172 transition count 296
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 242 place count 172 transition count 286
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 255 place count 159 transition count 256
Iterating global reduction 3 with 13 rules applied. Total rules applied 268 place count 159 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 272 place count 159 transition count 252
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 280 place count 151 transition count 244
Iterating global reduction 4 with 8 rules applied. Total rules applied 288 place count 151 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 292 place count 151 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 296 place count 147 transition count 235
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 147 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 301 place count 147 transition count 234
Applied a total of 301 rules in 11 ms. Remains 147 /275 variables (removed 128) and now considering 234/608 (removed 374) transitions.
// Phase 1: matrix 234 rows 147 cols
[2024-05-21 21:12:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:12:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:12:40] [INFO ] Invariant cache hit.
[2024-05-21 21:12:40] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-21 21:12:40] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 21:12:40] [INFO ] Invariant cache hit.
[2024-05-21 21:12:40] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/381 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 94/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/381 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 243 constraints, problems are : Problem set: 0 solved, 233 unsolved in 9372 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/381 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 94/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 233/476 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/381 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 476 constraints, problems are : Problem set: 0 solved, 233 unsolved in 19969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 29669ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 29673ms
Starting structural reductions in LTL mode, iteration 1 : 147/275 places, 234/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30168 ms. Remains : 147/275 places, 234/608 transitions.
[2024-05-21 21:13:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:13:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:13:10] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-21 21:13:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:10] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15886565645103282073.gal : 12 ms
[2024-05-21 21:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10178392916631481837.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/CTLFireability15886565645103282073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10178392916631481837.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,36810,1.63463,67760,2,8937,5,164167,6,0,822,162699,0


Converting to forward existential form...Done !
original formula: AF((AX(!(E(A(((s1>=1)&&(l3826>=1)) U ((s1>=1)&&(l2709>=1))) U ((s1>=1)&&(l2776>=1))))) * (EX(A(((s1>=1)&&(l2615>=1)) U (((s1>=1)&&(l2733>...212
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(E(!((E(!(((s1>=1)&&(l2709>=1))) U (!(((s1>=1)&&(l3826>=1))) * !(((s1>=1)&&(l2709>=1))))) ...455
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t29, t73, t74, t75, t76, t78, t79, t80, t81, t83, t84, t85, t86, t87, t...821
(forward)formula 0,0,11.3567,337420,1,0,727,1.44319e+06,514,362,5915,1.05917e+06,818
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 231 transition count 421
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 231 transition count 421
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 231 transition count 414
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 132 place count 194 transition count 367
Iterating global reduction 1 with 37 rules applied. Total rules applied 169 place count 194 transition count 367
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 190 place count 194 transition count 346
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 218 place count 166 transition count 296
Iterating global reduction 2 with 28 rules applied. Total rules applied 246 place count 166 transition count 296
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 259 place count 166 transition count 283
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 273 place count 152 transition count 245
Iterating global reduction 3 with 14 rules applied. Total rules applied 287 place count 152 transition count 245
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 299 place count 152 transition count 233
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 305 place count 146 transition count 227
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 146 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 315 place count 146 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 317 place count 144 transition count 221
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 144 transition count 221
Applied a total of 319 rules in 18 ms. Remains 144 /275 variables (removed 131) and now considering 221/608 (removed 387) transitions.
// Phase 1: matrix 221 rows 144 cols
[2024-05-21 21:13:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:13:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 21:13:21] [INFO ] Invariant cache hit.
[2024-05-21 21:13:21] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-21 21:13:22] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 21:13:22] [INFO ] Invariant cache hit.
[2024-05-21 21:13:22] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/365 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 84/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 232 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/365 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 84/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 220/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 452 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
After SMT, in 24543ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 24546ms
Starting structural reductions in LTL mode, iteration 1 : 144/275 places, 221/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24987 ms. Remains : 144/275 places, 221/608 transitions.
[2024-05-21 21:13:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:13:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:46] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 21:13:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:13:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14451316449254783823.gal : 1 ms
[2024-05-21 21:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2566514822658622329.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/CTLFireability14451316449254783823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2566514822658622329.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,34808,1.47493,59648,2,9165,5,145511,6,0,797,129268,0


Converting to forward existential form...Done !
original formula: (AF(AX(AF(((s1>=1)&&(l4272>=1))))) + (AX(((p173<1)||(l0<1))) * ((A(AG(((s1>=1)&&(l4110>=1))) U ((s1>=1)&&(l3079>=1))) + EX(((s1>=1)&&(l30...235
=> equivalent forward existential formula: ([(EY((Init * !(!(EG(!(!(EX(!(!(EG(!(((s1>=1)&&(l4272>=1)))))))))))))) * !(((p173<1)||(l0<1))))] = FALSE * [(Fwd...480
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t54, t56, t57, t76, t77, t81, t82, t83, t91, t92, t97, t98, t99, t100, ...729
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,9.87711,309392,1,0,593,1.33554e+06,489,267,5950,686785,738
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 228 transition count 403
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 228 transition count 403
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 101 place count 228 transition count 396
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 140 place count 189 transition count 345
Iterating global reduction 1 with 39 rules applied. Total rules applied 179 place count 189 transition count 345
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 198 place count 189 transition count 326
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 229 place count 158 transition count 272
Iterating global reduction 2 with 31 rules applied. Total rules applied 260 place count 158 transition count 272
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 274 place count 158 transition count 258
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 291 place count 141 transition count 210
Iterating global reduction 3 with 17 rules applied. Total rules applied 308 place count 141 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 315 place count 141 transition count 203
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 323 place count 133 transition count 195
Iterating global reduction 4 with 8 rules applied. Total rules applied 331 place count 133 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 335 place count 133 transition count 191
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 339 place count 129 transition count 186
Iterating global reduction 5 with 4 rules applied. Total rules applied 343 place count 129 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 129 transition count 185
Applied a total of 344 rules in 10 ms. Remains 129 /275 variables (removed 146) and now considering 185/608 (removed 423) transitions.
// Phase 1: matrix 185 rows 129 cols
[2024-05-21 21:13:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:13:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:13:56] [INFO ] Invariant cache hit.
[2024-05-21 21:13:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:13:57] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-21 21:13:57] [INFO ] Invariant cache hit.
[2024-05-21 21:13:57] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/314 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-21 21:14:00] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 193 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/314 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 184/377 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 377 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10781 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
After SMT, in 17427ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 17430ms
Starting structural reductions in LTL mode, iteration 1 : 129/275 places, 185/608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17816 ms. Remains : 129/275 places, 185/608 transitions.
[2024-05-21 21:14:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:14:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:14:14] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-21 21:14:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:14:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8400040201984026851.gal : 1 ms
[2024-05-21 21:14:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15761261514617788459.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/CTLFireability8400040201984026851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15761261514617788459.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,24444,0.70123,34216,2,6181,5,83975,6,0,701,79844,0


Converting to forward existential form...Done !
original formula: EX(E(EF(((p109>=1)&&(l0>=1))) U ((p121>=1)&&(l0>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),E(TRUE U ((p109>=1)&&(l0>=1)))) * ((p121>=1)&&(l0>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t72, t76, t77, t78, t86, t87, t93, t94, t95, t97, t98, t99, t101, ...591
(forward)formula 0,1,3.67034,129116,1,0,509,502059,396,255,4970,306331,603
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 229 transition count 405
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 229 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 229 transition count 399
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 136 place count 191 transition count 349
Iterating global reduction 1 with 38 rules applied. Total rules applied 174 place count 191 transition count 349
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 194 place count 191 transition count 329
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 224 place count 161 transition count 280
Iterating global reduction 2 with 30 rules applied. Total rules applied 254 place count 161 transition count 280
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 268 place count 161 transition count 266
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 283 place count 146 transition count 221
Iterating global reduction 3 with 15 rules applied. Total rules applied 298 place count 146 transition count 221
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 305 place count 146 transition count 214
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 311 place count 140 transition count 208
Iterating global reduction 4 with 6 rules applied. Total rules applied 317 place count 140 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 140 transition count 206
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 323 place count 136 transition count 201
Iterating global reduction 5 with 4 rules applied. Total rules applied 327 place count 136 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 328 place count 136 transition count 200
Applied a total of 328 rules in 27 ms. Remains 136 /275 variables (removed 139) and now considering 200/608 (removed 408) transitions.
// Phase 1: matrix 200 rows 136 cols
[2024-05-21 21:14:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:14:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:14:18] [INFO ] Invariant cache hit.
[2024-05-21 21:14:18] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 21:14:18] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-21 21:14:18] [INFO ] Redundant transitions in 1 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-21 21:14:18] [INFO ] Invariant cache hit.
[2024-05-21 21:14:18] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/336 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-21 21:14:22] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:14:22] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 205 constraints, problems are : Problem set: 0 solved, 199 unsolved in 8362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/336 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 65/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 199/404 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 404 constraints, problems are : Problem set: 0 solved, 199 unsolved in 14338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 2/2 constraints]
After SMT, in 22948ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 22950ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/275 places, 200/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23366 ms. Remains : 136/275 places, 200/608 transitions.
[2024-05-21 21:14:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:14:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:14:41] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-21 21:14:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:14:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6707591581256989545.gal : 1 ms
[2024-05-21 21:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1870030638318497632.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/CTLFireability6707591581256989545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1870030638318497632.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,34664,1.24334,50140,2,7999,5,129936,6,0,744,125708,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l4148>=1)) U AG(!((((s1>=1)&&(l1731>=1))||((p343>=1)&&(l2145>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,((s1>=1)&&(l4148>=1))) * !(E(TRUE U !(!((((s1>=1)&&(l1731>=1))||((p343>=1)&&(l2145>=1))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t28, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t...710
Hit Full ! (commute/partial/dont) 3/194/197
(forward)formula 0,0,4.61547,141132,1,0,424,540580,428,166,5546,232981,486
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 608/608 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 230 transition count 429
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 230 transition count 429
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 99 place count 230 transition count 420
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 136 place count 193 transition count 370
Iterating global reduction 1 with 37 rules applied. Total rules applied 173 place count 193 transition count 370
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 194 place count 193 transition count 349
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 221 place count 166 transition count 303
Iterating global reduction 2 with 27 rules applied. Total rules applied 248 place count 166 transition count 303
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 259 place count 166 transition count 292
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 273 place count 152 transition count 255
Iterating global reduction 3 with 14 rules applied. Total rules applied 287 place count 152 transition count 255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 301 place count 152 transition count 241
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 308 place count 145 transition count 234
Iterating global reduction 4 with 7 rules applied. Total rules applied 315 place count 145 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 318 place count 145 transition count 231
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 322 place count 141 transition count 226
Iterating global reduction 5 with 4 rules applied. Total rules applied 326 place count 141 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 141 transition count 225
Applied a total of 327 rules in 28 ms. Remains 141 /275 variables (removed 134) and now considering 225/608 (removed 383) transitions.
// Phase 1: matrix 225 rows 141 cols
[2024-05-21 21:14:46] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:14:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 21:14:46] [INFO ] Invariant cache hit.
[2024-05-21 21:14:46] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 21:14:46] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-21 21:14:46] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-21 21:14:46] [INFO ] Invariant cache hit.
[2024-05-21 21:14:46] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/366 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 233 constraints, problems are : Problem set: 0 solved, 224 unsolved in 8088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/366 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 224/457 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 457 constraints, problems are : Problem set: 0 solved, 224 unsolved in 17646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 26126ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 26130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 141/275 places, 225/608 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26524 ms. Remains : 141/275 places, 225/608 transitions.
[2024-05-21 21:15:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:15:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:12] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 21:15:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:15:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9897334011198770137.gal : 1 ms
[2024-05-21 21:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3493938258036953634.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/CTLFireability9897334011198770137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3493938258036953634.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,34501,1.20061,49840,2,8264,5,128260,6,0,789,119343,0


Converting to forward existential form...Done !
original formula: EF(!(E((((s1>=1)&&(l2801>=1)) + AG(!(((s1>=1)&&(l4106>=1))))) U (!((((s1>=1)&&(l4102>=1))||((s1>=1)&&(l3082>=1)))) * EG(AF(((s1>=1)&&(l38...168
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((((s1>=1)&&(l2801>=1)) + !(E(TRUE U !(!(((s1>=1)&&(l4106>=1))))))) U (!((((s1>=1)&&(l410...238
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t71, t72, t76, t77, t78, t86, t87, t91, t92, t93, t94, t95, t96, t...726
Using saturation style SCC detection
(forward)formula 0,1,6.96059,230280,1,0,552,1.09961e+06,491,237,5763,487107,677
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 21:15:20] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:15:20] [INFO ] Flatten gal took : 12 ms
Total runtime 514692 ms.

BK_STOP 1716326120144

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m04"
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-d2m04, 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-171624189500546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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