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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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-d0m06-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716317532183

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 18:52:13] [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 18:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:52:13] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 18:52:13] [INFO ] Transformed 553 places.
[2024-05-21 18:52:13] [INFO ] Transformed 150 transitions.
[2024-05-21 18:52:13] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 70 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 135
Applied a total of 26 rules in 24 ms. Remains 98 /109 variables (removed 11) and now considering 135/150 (removed 15) transitions.
// Phase 1: matrix 135 rows 98 cols
[2024-05-21 18:52:13] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 18:52:13] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 18:52:13] [INFO ] Invariant cache hit.
[2024-05-21 18:52:13] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 18:52:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-21 18:52:13] [INFO ] Invariant cache hit.
[2024-05-21 18:52:14] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 62/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 162 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 62/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 134/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 296 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 9304ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 9320ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 135/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9716 ms. Remains : 98/109 places, 135/150 transitions.
Support contains 70 out of 98 places after structural reductions.
[2024-05-21 18:52:23] [INFO ] Flatten gal took : 31 ms
[2024-05-21 18:52:23] [INFO ] Flatten gal took : 18 ms
[2024-05-21 18:52:23] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (9195 resets) in 3187 ms. (12 steps per ms) remains 37/67 properties
BEST_FIRST walk for 4002 steps (196 resets) in 98 ms. (40 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4001 steps (203 resets) in 97 ms. (40 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (201 resets) in 70 ms. (56 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (199 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (190 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (800 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (184 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (207 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (407 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (201 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (185 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (212 resets) in 16 ms. (235 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (386 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (188 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (191 resets) in 12 ms. (308 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4001 steps (392 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (204 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (214 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (215 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (422 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (209 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (210 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (255 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (188 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (613 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (405 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (176 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (187 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (437 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (428 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (209 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
[2024-05-21 18:52:24] [INFO ] Invariant cache hit.
[2024-05-21 18:52:24] [INFO ] State equation strengthened by 62 read => feed constraints.
Problem AtomicPropp19 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/69 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 17/86 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 125/211 variables, 86/88 constraints. Problems are: Problem set: 4 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 52/140 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 22/233 variables, 12/152 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 10/162 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 162 constraints, problems are : Problem set: 4 solved, 28 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 28/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 22/85 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 125/210 variables, 85/87 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 52/139 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 3/142 constraints. Problems are: Problem set: 4 solved, 28 unsolved
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 12 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:52:26] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 7 ms to minimize.
[2024-05-21 18:52:27] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:52:27] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 20/162 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 23/233 variables, 13/175 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 10/185 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 25/210 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/233 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 210 constraints, problems are : Problem set: 4 solved, 28 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 28/32 constraints, Known Traps: 20/20 constraints]
After SMT, in 3730ms problems are : Problem set: 4 solved, 28 unsolved
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 1064 ms.
Support contains 35 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 130
Applied a total of 10 rules in 17 ms. Remains 93 /98 variables (removed 5) and now considering 130/135 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 93/98 places, 130/135 transitions.
RANDOM walk for 40000 steps (9133 resets) in 295 ms. (135 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (180 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (189 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (186 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (220 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (220 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (178 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (208 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (421 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (178 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (176 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (380 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (183 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (199 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (377 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (192 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (177 resets) in 15 ms. (250 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (208 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (391 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (216 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (219 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (203 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (203 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (428 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (212 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 74938 steps, run visited all 26 properties in 381 ms. (steps per millisecond=196 )
Probabilistic random walk after 74938 steps, saw 31198 distinct states, run finished after 385 ms. (steps per millisecond=194 ) properties seen :26
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 18:52:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:52:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:52:30] [INFO ] Input system was already deterministic with 135 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 327 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 103
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 69 transition count 92
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 66 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 79
Applied a total of 74 rules in 19 ms. Remains 64 /98 variables (removed 34) and now considering 79/135 (removed 56) transitions.
// Phase 1: matrix 79 rows 64 cols
[2024-05-21 18:52:30] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:52:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 18:52:30] [INFO ] Invariant cache hit.
[2024-05-21 18:52:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 18:52:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 18:52:30] [INFO ] Redundant transitions in 0 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-21 18:52:30] [INFO ] Invariant cache hit.
[2024-05-21 18:52:30] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 30/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 30/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 78/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 174 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3176ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3177ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/98 places, 79/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3330 ms. Remains : 64/98 places, 79/135 transitions.
[2024-05-21 18:52:33] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:52:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:52:33] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-21 18:52:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:52:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11756390767695731957.gal : 3 ms
[2024-05-21 18:52:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16154200481049840211.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11756390767695731957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16154200481049840211.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,316408,0.452766,20796,2,5655,5,70453,6,0,335,67125,0


Converting to forward existential form...Done !
original formula: E(AG(!(((s1>=1)&&(l355>=1)))) U EG(E((E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l335>=1))) + ((s9>=1)&&(l152>=1))) U (((s1>=1)&&(l339>=1))||(((...213
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(E(TRUE U !(!(((s1>=1)&&(l355>=1))))))),E((E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l335>=1))) + ((s...269
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53, t54, t5...351
(forward)formula 0,0,3.0691,95384,1,0,251,455462,199,111,2305,429148,278
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 103
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 103
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 75 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 75 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 75 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 74 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 74 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 73 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 73 transition count 90
Applied a total of 52 rules in 8 ms. Remains 73 /98 variables (removed 25) and now considering 90/135 (removed 45) transitions.
// Phase 1: matrix 90 rows 73 cols
[2024-05-21 18:52:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:52:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:52:37] [INFO ] Invariant cache hit.
[2024-05-21 18:52:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 18:52:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-21 18:52:37] [INFO ] Invariant cache hit.
[2024-05-21 18:52:37] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/163 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 30/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 105 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/163 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 30/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 89/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3918ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3919ms
Starting structural reductions in LTL mode, iteration 1 : 73/98 places, 90/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4068 ms. Remains : 73/98 places, 90/135 transitions.
[2024-05-21 18:52:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:52:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:52:41] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 18:52:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6149563954335476257.gal : 2 ms
[2024-05-21 18:52:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8824592796350137594.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/CTLFireability6149563954335476257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8824592796350137594.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,489084,1.68779,57944,2,10279,5,200154,6,0,382,200590,0


Converting to forward existential form...Done !
original formula: AX(EG((((p22<1)||(l0<1)) * (((AX(((s1<1)||(l485<1))) + EX(((s1<1)||(l496<1)))) + ((s1<1)||(l492<1))) + (((s1<1)||(l133<1))&&((s1<1)||(l90...164
=> equivalent forward existential formula: [(EY(Init) * !(EG((((p22<1)||(l0<1)) * (((!(EX(!(((s1<1)||(l485<1))))) + EX(((s1<1)||(l496<1)))) + ((s1<1)||(l49...217
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t53, t54, t63, t64, t65, t66, t67, t68, t69, t70, t71, t7...341
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,8.7879,240256,1,0,290,1.2277e+06,209,144,2701,977623,314
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 98
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 67 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 59 transition count 67
Applied a total of 85 rules in 18 ms. Remains 59 /98 variables (removed 39) and now considering 67/135 (removed 68) transitions.
// Phase 1: matrix 67 rows 59 cols
[2024-05-21 18:52:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:52:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 18:52:49] [INFO ] Invariant cache hit.
[2024-05-21 18:52:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:52:50] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 18:52:50] [INFO ] Invariant cache hit.
[2024-05-21 18:52:50] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2515ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2516ms
Starting structural reductions in LTL mode, iteration 1 : 59/98 places, 67/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2640 ms. Remains : 59/98 places, 67/135 transitions.
[2024-05-21 18:52:52] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:52:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:52] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-21 18:52:52] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:52:52] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3273573513571630087.gal : 1 ms
[2024-05-21 18:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13660651926584869740.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/CTLFireability3273573513571630087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13660651926584869740.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,139528,0.194879,12412,2,4370,5,34685,6,0,303,30305,0


Converting to forward existential form...Done !
original formula: AX(E(((s2>=1)&&(l497>=1)) U AG(EF(((s1>=1)&&(l32>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((s2>=1)&&(l497>=1)) U !(E(TRUE U !(E(TRUE U ((s1>=1)&&(l32>=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...291
(forward)formula 0,0,2.25522,81040,1,0,149,380433,159,66,2069,294405,169
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 83 transition count 110
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 73 transition count 100
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 73 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 71 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 71 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 69 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 69 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 68 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 68 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 68 transition count 90
Applied a total of 64 rules in 12 ms. Remains 68 /98 variables (removed 30) and now considering 90/135 (removed 45) transitions.
// Phase 1: matrix 90 rows 68 cols
[2024-05-21 18:52:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:52:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 18:52:54] [INFO ] Invariant cache hit.
[2024-05-21 18:52:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 18:52:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-21 18:52:55] [INFO ] Invariant cache hit.
[2024-05-21 18:52:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/158 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 37/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 107 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/158 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 37/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 89/196 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 4482ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4482ms
Starting structural reductions in LTL mode, iteration 1 : 68/98 places, 90/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4627 ms. Remains : 68/98 places, 90/135 transitions.
[2024-05-21 18:52:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:52:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:52:59] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 18:52:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11817108731991983644.gal : 3 ms
[2024-05-21 18:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3919647095294686908.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/CTLFireability11817108731991983644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3919647095294686908.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,395847,0.953184,37460,2,7116,5,145974,6,0,362,106770,0


Converting to forward existential form...Done !
original formula: EX(AF(((((s1>=1)&&(l486>=1))||((s1>=1)&&(l149>=1))) * (AX(((s1<1)||(l353<1))) + ((((s9<1)||(l152<1))&&((s1<1)||(l354<1)))&&(((s1<1)||(l1<...173
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((((s1>=1)&&(l486>=1))||((s1>=1)&&(l149>=1))) * (!(EX(!(((s1<1)||(l353<1))))) + ((((s9<1)||(...230
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t49, t50,...394
Using saturation style SCC detection
(forward)formula 0,0,6.52704,193248,1,0,309,1.04374e+06,207,139,2536,817863,324
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-03 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 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 83 transition count 110
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 75 transition count 102
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 75 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 74 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 74 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 73 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 73 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 72 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 72 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 72 transition count 95
Applied a total of 55 rules in 7 ms. Remains 72 /98 variables (removed 26) and now considering 95/135 (removed 40) transitions.
// Phase 1: matrix 95 rows 72 cols
[2024-05-21 18:53:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:53:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 18:53:06] [INFO ] Invariant cache hit.
[2024-05-21 18:53:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 18:53:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-21 18:53:06] [INFO ] Invariant cache hit.
[2024-05-21 18:53:06] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/167 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 39/113 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:53:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:53:07] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/167 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 94/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 209 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
After SMT, in 6216ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6218ms
Starting structural reductions in LTL mode, iteration 1 : 72/98 places, 95/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6390 ms. Remains : 72/98 places, 95/135 transitions.
[2024-05-21 18:53:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:53:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:53:12] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-21 18:53:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16006023056638958824.gal : 2 ms
[2024-05-21 18:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7605276403649583953.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/CTLFireability16006023056638958824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7605276403649583953.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,672295,0.88162,34700,2,5957,5,128738,6,0,383,99657,0


Converting to forward existential form...Done !
original formula: !(E(((((s1>=1)&&(l502>=1)) + EF(!(A(((s1>=1)&&(l345>=1)) U ((p20>=1)&&(l115>=1)))))) + (!((((s1>=1)&&(l149>=1)) + AG(!(((s1<1)||(l353<1))...249
=> equivalent forward existential formula: [(FwdU(Init,((((s1>=1)&&(l502>=1)) + E(TRUE U !(!((E(!(((p20>=1)&&(l115>=1))) U (!(((s1>=1)&&(l345>=1))) * !(((p...392
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t51, t52, t59, t6...401
(forward)formula 0,1,2.69251,84356,1,0,197,344759,212,75,2654,260555,208
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 99
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 71 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 70 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 70 transition count 85
Applied a total of 60 rules in 10 ms. Remains 70 /98 variables (removed 28) and now considering 85/135 (removed 50) transitions.
// Phase 1: matrix 85 rows 70 cols
[2024-05-21 18:53:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:53:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:53:15] [INFO ] Invariant cache hit.
[2024-05-21 18:53:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 18:53:15] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 18:53:15] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:53:15] [INFO ] Invariant cache hit.
[2024-05-21 18:53:15] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/155 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 99 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/155 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 84/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 183 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 3569ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3570ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/98 places, 85/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3713 ms. Remains : 70/98 places, 85/135 transitions.
[2024-05-21 18:53:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:53:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:19] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-21 18:53:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17558233149082345888.gal : 1 ms
[2024-05-21 18:53:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9085624339625456886.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/CTLFireability17558233149082345888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9085624339625456886.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,552330,0.963629,39000,2,6120,5,133797,6,0,365,129721,0


Converting to forward existential form...Done !
original formula: EG((EF((((((s1<1)||(l504<1))&&(s1>=1))&&((l490>=1)&&(s1>=1)))&&(l355>=1))) + ((s1>=1)&&(l110>=1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((((s1<1)||(l504<1))&&(s1>=1))&&((l490>=1)&&(s1>=1)))&&(l355>=1))) + ((s1>=1)&&(l110>=1)))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t49, t52, t53, t54, t61, t62, t63, t64, t65, t66, t67, t68, t6...331
(forward)formula 0,1,7.40831,214196,1,0,433,1.04554e+06,198,229,2576,1.03956e+06,416
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 85 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 85 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 85 transition count 114
Applied a total of 28 rules in 5 ms. Remains 85 /98 variables (removed 13) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 85 cols
[2024-05-21 18:53:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:53:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:53:26] [INFO ] Invariant cache hit.
[2024-05-21 18:53:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 18:53:26] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-21 18:53:26] [INFO ] Invariant cache hit.
[2024-05-21 18:53:26] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/199 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 50/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 137 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/199 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 50/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 113/250 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 250 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 6209ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6210ms
Starting structural reductions in LTL mode, iteration 1 : 85/98 places, 114/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6385 ms. Remains : 85/98 places, 114/135 transitions.
[2024-05-21 18:53:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:53:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:53:32] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-21 18:53:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:53:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:53:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11076095135901839030.gal : 1 ms
[2024-05-21 18:53:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6517969159922708179.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/CTLFireability11076095135901839030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6517969159922708179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (A((((((((!((s1>=1)&&(l489>=1)))||(!((s1>=1)&&(l487>=1)))) * (!(((s1>=1)&&(l502>=1))) + AF(((s1>=1)&&(l150>=1))))) + AF(((s1>=1)&&(l91>=1...775
=> equivalent forward existential formula: ((((([(FwdU((FwdU((FwdU(((FwdU(Init,!((!((E(!(!((E(!((((s2>=1)&&(l497>=1))||((s1>=1)&&(l33>=1)))) U (!(!((E(!(((...9679
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...479
Hit Full ! (commute/partial/dont) 2/110/112
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,23.0094,635144,1,0,871,3.52428e+06,367,431,3577,3.06946e+06,1079
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 81 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 81 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 81 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 71 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 69 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 83
Applied a total of 62 rules in 4 ms. Remains 69 /98 variables (removed 29) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 69 cols
[2024-05-21 18:53:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 18:53:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 18:53:56] [INFO ] Invariant cache hit.
[2024-05-21 18:53:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:53:56] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-21 18:53:56] [INFO ] Invariant cache hit.
[2024-05-21 18:53:56] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 96 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 178 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 3655ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3655ms
Starting structural reductions in LTL mode, iteration 1 : 69/98 places, 83/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3783 ms. Remains : 69/98 places, 83/135 transitions.
[2024-05-21 18:53:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:53:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:53:59] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-21 18:53:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:53:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:53:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11498902016917306863.gal : 1 ms
[2024-05-21 18:53:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2520908996930575117.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/CTLFireability11498902016917306863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2520908996930575117.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,428554,1.36886,50220,2,8761,5,192314,6,0,359,155061,0


Converting to forward existential form...Done !
original formula: E((((!((p28>=1)&&(l0>=1)))&&(s1>=1))&&(l486>=1)) U EX(EX((EF(((s1>=1)&&(l487>=1))) + ((p15>=1)&&(l0>=1))))))
=> equivalent forward existential formula: ([(FwdU(EY(EY(FwdU(Init,(((!((p28>=1)&&(l0>=1)))&&(s1>=1))&&(l486>=1))))),TRUE) * ((s1>=1)&&(l487>=1)))] != FALS...260
Hit Full ! (commute/partial/dont) 1/105/82
(forward)formula 0,1,2.20051,51540,1,0,11,193888,16,1,830,157383,8
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 64 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 63 transition count 72
Applied a total of 77 rules in 9 ms. Remains 63 /98 variables (removed 35) and now considering 72/135 (removed 63) transitions.
// Phase 1: matrix 72 rows 63 cols
[2024-05-21 18:54:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:54:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:54:02] [INFO ] Invariant cache hit.
[2024-05-21 18:54:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:54:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 18:54:02] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 18:54:02] [INFO ] Invariant cache hit.
[2024-05-21 18:54:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2852ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/98 places, 72/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2987 ms. Remains : 63/98 places, 72/135 transitions.
[2024-05-21 18:54:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:05] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-21 18:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11190221030337590347.gal : 14 ms
[2024-05-21 18:54:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2812465885284039695.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11190221030337590347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2812465885284039695.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9199 resets) in 88 ms. (449 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
BEST_FIRST walk for 40003 steps (2002 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality2812465885284039695.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 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 142
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :142 after 264
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :264 after 1374
Finished probabilistic random walk after 8219 steps, run visited all 1 properties in 41 ms. (steps per millisecond=200 )
Probabilistic random walk after 8219 steps, saw 3599 distinct states, run finished after 41 ms. (steps per millisecond=200 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-08 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 : 98/98 places, 135/135 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 82 transition count 107
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 82 transition count 107
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 71 transition count 96
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 71 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 71 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 69 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 68 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 67 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 67 transition count 84
Applied a total of 67 rules in 4 ms. Remains 67 /98 variables (removed 31) and now considering 84/135 (removed 51) transitions.
// Phase 1: matrix 84 rows 67 cols
[2024-05-21 18:54:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:54:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:54:05] [INFO ] Invariant cache hit.
[2024-05-21 18:54:05] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:54:05] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 18:54:05] [INFO ] Invariant cache hit.
[2024-05-21 18:54:05] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/151 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 34/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 103 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/151 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 34/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 83/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 186 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 3634ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3635ms
Starting structural reductions in LTL mode, iteration 1 : 67/98 places, 84/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3809 ms. Remains : 67/98 places, 84/135 transitions.
[2024-05-21 18:54:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:54:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:09] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 18:54:09] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:54:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:54:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15612809562067426054.gal : 4 ms
[2024-05-21 18:54:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12573028105632020435.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/CTLFireability15612809562067426054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12573028105632020435.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,343753,0.457667,23852,2,6307,5,77825,6,0,352,73057,0


Converting to forward existential form...Done !
original formula: EX((AF(((AG(((s1<1)||(l37<1))) * ((s1<1)||(l502<1))) * ((s1<1)||(l496<1)))) * EX(EF(((((s1>=1)&&(l150>=1))||(s1<1))||(l502<1))))))
=> equivalent forward existential formula: [(FwdU(EY((EY(Init) * !(EG(!(((!(E(TRUE U !(((s1<1)||(l37<1))))) * ((s1<1)||(l502<1))) * ((s1<1)||(l496<1)))))))...218
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t52, t56, t5...371
Using saturation style SCC detection
(forward)formula 0,1,2.99802,99552,1,0,285,430415,202,132,2554,403715,324
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 97
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 73
Applied a total of 76 rules in 8 ms. Remains 63 /98 variables (removed 35) and now considering 73/135 (removed 62) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 18:54:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:54:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:54:12] [INFO ] Invariant cache hit.
[2024-05-21 18:54:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:54:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 18:54:12] [INFO ] Invariant cache hit.
[2024-05-21 18:54:12] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2846ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2846ms
Starting structural reductions in LTL mode, iteration 1 : 63/98 places, 73/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2982 ms. Remains : 63/98 places, 73/135 transitions.
[2024-05-21 18:54:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:54:15] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:15] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 18:54:15] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5753225969613591582.gal : 0 ms
[2024-05-21 18:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16039592520831746112.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/CTLFireability5753225969613591582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16039592520831746112.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,269078,0.76064,26116,2,6173,5,82718,6,0,325,84740,0


Converting to forward existential form...Done !
original formula: EF((EX(TRUE) * EF((EG(((s1>=1)&&(l339>=1))) + ((s1>=1)&&(l487>=1))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,TRUE) * EX(TRUE)),TRUE),((s1>=1)&&(l339>=1)))] != FALSE + [(FwdU((FwdU(Init,TRUE) * EX(TR...200
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
Hit Full ! (commute/partial/dont) 1/69/72
(forward)formula 0,1,2.45283,59388,1,0,153,234649,173,61,2434,218580,169
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 82 transition count 107
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 82 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 82 transition count 105
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 74 transition count 97
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 74 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 74 transition count 95
Applied a total of 52 rules in 4 ms. Remains 74 /98 variables (removed 24) and now considering 95/135 (removed 40) transitions.
// Phase 1: matrix 95 rows 74 cols
[2024-05-21 18:54:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:54:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 18:54:17] [INFO ] Invariant cache hit.
[2024-05-21 18:54:17] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:54:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-21 18:54:17] [INFO ] Invariant cache hit.
[2024-05-21 18:54:17] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/169 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:54:18] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 111 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/169 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 34/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 94/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 205 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints]
After SMT, in 4783ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 4784ms
Starting structural reductions in LTL mode, iteration 1 : 74/98 places, 95/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4928 ms. Remains : 74/98 places, 95/135 transitions.
[2024-05-21 18:54:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:54:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:54:22] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-21 18:54:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3223100580920868580.gal : 1 ms
[2024-05-21 18:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12404519164729695068.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/CTLFireability3223100580920868580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12404519164729695068.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,703569,1.50603,48124,2,8409,5,169990,6,0,391,159780,0


Converting to forward existential form...Done !
original formula: (AG((EG(EF(((s1>=1)&&(l501>=1)))) * (EF(((s1<1)||(l510<1))) + (EX(((s1<1)||(l502<1))) * EX(((s1<1)||(l149<1))))))) * A(((s1>=1)&&(l486>=1...210
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG(E(TRUE U ((s1>=1)&&(l501>=1))))))] = FALSE * [((FwdU(Init,TRUE) * !((EX(((s1<1)||(l50...489
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t57, t58, t61, t62, t6...381
Using saturation style SCC detection
(forward)formula 0,0,11.0466,280588,1,0,341,1.44241e+06,231,166,2777,1.22966e+06,407
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 83 transition count 106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 75 transition count 98
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 74 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 74 transition count 93
Applied a total of 52 rules in 3 ms. Remains 74 /98 variables (removed 24) and now considering 93/135 (removed 42) transitions.
// Phase 1: matrix 93 rows 74 cols
[2024-05-21 18:54:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:54:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 18:54:33] [INFO ] Invariant cache hit.
[2024-05-21 18:54:33] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:54:33] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-21 18:54:33] [INFO ] Invariant cache hit.
[2024-05-21 18:54:33] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/167 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:54:35] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 111 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/167 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 92/203 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 203 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 5968ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5969ms
Starting structural reductions in LTL mode, iteration 1 : 74/98 places, 93/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6111 ms. Remains : 74/98 places, 93/135 transitions.
[2024-05-21 18:54:39] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:54:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:54:39] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-21 18:54:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17000116868517674637.gal : 1 ms
[2024-05-21 18:54:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6592952575352935248.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/CTLFireability17000116868517674637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6592952575352935248.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,717140,1.59202,55368,2,10491,5,217009,6,0,389,156071,0


Converting to forward existential form...Done !
original formula: A(E(!((((E(((s1>=1)&&(l488>=1)) U ((p12>=1)&&(l0>=1))) * AX(((s1>=1)&&(l509>=1)))) * (E(((s6>=1)&&(l0>=1)) U ((s1>=1)&&(l33>=1))) * (s1>=...284
=> equivalent forward existential formula: [((Init * !(EG(!(((s5>=1)&&(l0>=1)))))) * !(E(!(((s5>=1)&&(l0>=1))) U (!(E(!((((E(((s1>=1)&&(l488>=1)) U ((p12>=...415
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t29, t46, t47, t48, t53, t54, t55, t56, t59, t60, t61,...379
(forward)formula 0,0,11.6824,303552,1,0,366,1.70033e+06,235,151,2715,1.34119e+06,419
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 82
Applied a total of 65 rules in 2 ms. Remains 67 /98 variables (removed 31) and now considering 82/135 (removed 53) transitions.
// Phase 1: matrix 82 rows 67 cols
[2024-05-21 18:54:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:54:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:54:51] [INFO ] Invariant cache hit.
[2024-05-21 18:54:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:54:51] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-21 18:54:51] [INFO ] Invariant cache hit.
[2024-05-21 18:54:51] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 92 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 81/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 173 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 3504ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3505ms
Starting structural reductions in LTL mode, iteration 1 : 67/98 places, 82/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3615 ms. Remains : 67/98 places, 82/135 transitions.
[2024-05-21 18:54:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:54:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:54:55] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-21 18:54:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:54:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3250667282716486146.gal : 0 ms
[2024-05-21 18:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17547995594012524338.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/CTLFireability3250667282716486146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17547995594012524338.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,420375,0.504326,24756,2,5275,5,86607,6,0,350,76825,0


Converting to forward existential form...Done !
original formula: EX(!(A(AF(AX(((p20>=1)&&(l115>=1)))) U ((!(EX(((p10>=1)&&(l153>=1)))) * !(((s1>=1)&&(l337>=1)))) * ((p35>=1)&&(l136>=1))))))
=> equivalent forward existential formula: ((([(EY((FwdU(EY(Init),!(((!(EX(((p10>=1)&&(l153>=1)))) * !(((s1>=1)&&(l337>=1)))) * ((p35>=1)&&(l136>=1))))) * ...733
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t7...306
Using saturation style SCC detection
(forward)formula 0,1,6.83661,199792,1,0,388,971625,197,235,2502,958401,451
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 97
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 96
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 67 transition count 84
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 59 transition count 65
Applied a total of 86 rules in 10 ms. Remains 59 /98 variables (removed 39) and now considering 65/135 (removed 70) transitions.
// Phase 1: matrix 65 rows 59 cols
[2024-05-21 18:55:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:55:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:55:02] [INFO ] Invariant cache hit.
[2024-05-21 18:55:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:55:02] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-21 18:55:02] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 18:55:02] [INFO ] Invariant cache hit.
[2024-05-21 18:55:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 81 constraints, problems are : Problem set: 0 solved, 64 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 145 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2383ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2384ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/98 places, 65/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2502 ms. Remains : 59/98 places, 65/135 transitions.
[2024-05-21 18:55:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:55:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:55:04] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-21 18:55:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:55:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2314143367627155511.gal : 1 ms
[2024-05-21 18:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13446249247265110510.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/CTLFireability2314143367627155511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13446249247265110510.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,134054,0.343005,16636,2,5817,5,48008,6,0,301,48180,0


Converting to forward existential form...Done !
original formula: EF(AG(((s6>=1)&&(l0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((s6>=1)&&(l0>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...291
(forward)formula 0,0,1.58715,48716,1,0,132,191488,152,54,2038,151947,143
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 109
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 83 transition count 108
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 74 transition count 99
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 71 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 69 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 69 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 67 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 67 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 66 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 66 transition count 83
Applied a total of 69 rules in 8 ms. Remains 66 /98 variables (removed 32) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 66 cols
[2024-05-21 18:55:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:55:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:55:06] [INFO ] Invariant cache hit.
[2024-05-21 18:55:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 18:55:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-21 18:55:06] [INFO ] Invariant cache hit.
[2024-05-21 18:55:06] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 101 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 82/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 183 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 3474ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3475ms
Starting structural reductions in LTL mode, iteration 1 : 66/98 places, 83/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3591 ms. Remains : 66/98 places, 83/135 transitions.
[2024-05-21 18:55:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:55:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:55:09] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-21 18:55:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:55:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14545057151679556578.gal : 2 ms
[2024-05-21 18:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2958141888079313992.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/CTLFireability14545057151679556578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2958141888079313992.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,263867,1.34861,44284,2,9537,5,164540,6,0,347,130934,0


Converting to forward existential form...Done !
original formula: (EX((((!(A((((s1>=1)&&(l491>=1))||((s1>=1)&&(l114>=1))) U !(((s1>=1)&&(l1>=1))))) * AG(((s1<1)||(l36<1)))) + AG(((p29>=1)&&(l0>=1)))) + A...226
=> equivalent forward existential formula: ((([((EY(Init) * !(!((E(!(!(((s1>=1)&&(l1>=1)))) U (!((((s1>=1)&&(l491>=1))||((s1>=1)&&(l114>=1)))) * !(!(((s1>=...444
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t44,...394
Hit Full ! (commute/partial/dont) 1/0/82
(forward)formula 0,1,9.12471,235924,1,0,247,1.07474e+06,211,100,2480,957088,272
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 18:55:19] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:55:19] [INFO ] Flatten gal took : 3 ms
Total runtime 185856 ms.

BK_STOP 1716317719226

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

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