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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:46 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-d0m07-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716317704152

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-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 18:55:05] [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:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:55:05] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-21 18:55:05] [INFO ] Transformed 553 places.
[2024-05-21 18:55:05] [INFO ] Transformed 150 transitions.
[2024-05-21 18:55:05] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 55 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 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 27 place count 93 transition count 130
Iterating global reduction 1 with 9 rules applied. Total rules applied 36 place count 93 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 92 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 92 transition count 129
Applied a total of 38 rules in 26 ms. Remains 92 /109 variables (removed 17) and now considering 129/150 (removed 21) transitions.
// Phase 1: matrix 129 rows 92 cols
[2024-05-21 18:55:05] [INFO ] Computed 2 invariants in 11 ms
[2024-05-21 18:55:05] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 18:55:05] [INFO ] Invariant cache hit.
[2024-05-21 18:55:05] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 18:55:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 18:55:05] [INFO ] Invariant cache hit.
[2024-05-21 18:55:05] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/221 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 59/153 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 153 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/221 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 59/153 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 128/281 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 281 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 10460ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10483ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 129/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10880 ms. Remains : 92/109 places, 129/150 transitions.
Support contains 55 out of 92 places after structural reductions.
[2024-05-21 18:55:16] [INFO ] Flatten gal took : 29 ms
[2024-05-21 18:55:16] [INFO ] Flatten gal took : 14 ms
[2024-05-21 18:55:16] [INFO ] Input system was already deterministic with 129 transitions.
Support contains 54 out of 92 places (down from 55) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 49 to 47
RANDOM walk for 40000 steps (9148 resets) in 1444 ms. (27 steps per ms) remains 25/47 properties
BEST_FIRST walk for 4003 steps (406 resets) in 81 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (353 resets) in 92 ms. (43 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (192 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (184 resets) in 51 ms. (76 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (381 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (212 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (194 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (381 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (433 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (203 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (173 resets) in 21 ms. (181 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4001 steps (181 resets) in 16 ms. (235 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (194 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (800 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (217 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (208 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (500 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (179 resets) in 20 ms. (190 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (199 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (198 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (375 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (393 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
[2024-05-21 18:55:17] [INFO ] Invariant cache hit.
[2024-05-21 18:55:17] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 18/75 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 118/193 variables, 75/77 constraints. Problems are: Problem set: 1 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 48/125 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 28/221 variables, 17/142 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 11/153 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-21 18:55:17] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 11 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 9 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 6/159 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:55:18] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 2/161 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 161 constraints, problems are : Problem set: 2 solved, 19 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/74 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 113/187 variables, 74/76 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 43/119 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/120 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-21 18:55:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 1/121 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 34/221 variables, 18/139 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 16/155 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 18/173 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 8/181 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/221 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 181 constraints, problems are : Problem set: 2 solved, 19 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 9/9 constraints]
After SMT, in 2769ms problems are : Problem set: 2 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 1186 ms.
Support contains 27 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 87 transition count 118
Applied a total of 10 rules in 13 ms. Remains 87 /92 variables (removed 5) and now considering 118/129 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 87/92 places, 118/129 transitions.
RANDOM walk for 40000 steps (9132 resets) in 457 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (397 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (394 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (190 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (381 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (211 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (188 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (411 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (186 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (800 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (204 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (209 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (500 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (206 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (187 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (218 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (403 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (387 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 809564 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :15 out of 17
Probabilistic random walk after 809564 steps, saw 321002 distinct states, run finished after 3007 ms. (steps per millisecond=269 ) properties seen :15
// Phase 1: matrix 118 rows 87 cols
[2024-05-21 18:55:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:55:24] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/151 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 54/205 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 28/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/151 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 54/205 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 28/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 256 ms.
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 118/118 transitions.
Graph (complete) has 257 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 116
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 78 transition count 101
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 78 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 78 transition count 99
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 74 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 74 transition count 95
Applied a total of 29 rules in 16 ms. Remains 74 /87 variables (removed 13) and now considering 95/118 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 74/87 places, 95/118 transitions.
RANDOM walk for 40000 steps (9152 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2089 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 857777 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 2
Probabilistic random walk after 857777 steps, saw 334513 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
// Phase 1: matrix 95 rows 74 cols
[2024-05-21 18:55:28] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 18:55:28] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/141 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/169 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/141 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/169 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 74/74 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-21 18:55:28] [INFO ] Invariant cache hit.
[2024-05-21 18:55:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 18:55:28] [INFO ] Invariant cache hit.
[2024-05-21 18:55:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 18:55:29] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 18:55:29] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-21 18:55:29] [INFO ] Invariant cache hit.
[2024-05-21 18:55:29] [INFO ] State equation strengthened by 31 read => feed constraints.
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, 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, 31/107 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 107 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1589 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 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, 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, 31/107 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 94/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 201 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2825 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 4485ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 4487ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4647 ms. Remains : 74/74 places, 95/95 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 74 transition count 92
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 74 transition count 86
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 67 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 66 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 66 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 63 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 62 transition count 89
Applied a total of 27 rules in 19 ms. Remains 62 /74 variables (removed 12) and now considering 89/95 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 89 rows 62 cols
[2024-05-21 18:55:33] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 18:55:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 18:55:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 18:55:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:55:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 18:55:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 18:55:33] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 18:55:33] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:55:33] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 233 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-21 18:55:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:55:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:55:33] [INFO ] Input system was already deterministic with 129 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 307 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 75 transition count 93
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 75 transition count 92
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 67 transition count 84
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 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 53 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 65 transition count 79
Applied a total of 57 rules in 9 ms. Remains 65 /92 variables (removed 27) and now considering 79/129 (removed 50) transitions.
// Phase 1: matrix 79 rows 65 cols
[2024-05-21 18:55:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:55:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 18:55:33] [INFO ] Invariant cache hit.
[2024-05-21 18:55:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:55:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-21 18:55:33] [INFO ] Invariant cache hit.
[2024-05-21 18:55:33] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/144 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 90 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/144 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 78/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3236ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3237ms
Starting structural reductions in LTL mode, iteration 1 : 65/92 places, 79/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3380 ms. Remains : 65/92 places, 79/129 transitions.
[2024-05-21 18:55:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:55:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:55:37] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-21 18:55:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:55:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:55:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4078671519399905913.gal : 2 ms
[2024-05-21 18:55:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11740856326788555894.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/CTLFireability4078671519399905913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11740856326788555894.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.78368e+06,2.09441,60428,2,9732,5,220316,6,0,339,218235,0


Converting to forward existential form...Done !
original formula: EG(!(A(EX(!(((p18>=1)&&(l115>=1)))) U E(!(AF(((s1>=1)&&(l510>=1)))) U ((s1>=1)&&(l345>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(!(!(EG(!(((s1>=1)&&(l510>=1)))))) U ((s1>=1)&&(l345>=1)))) U (!(EX(!(((p18>=1)&&(l115>=1))...308
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t6...301
Using saturation style SCC detection
(forward)formula 0,0,27.3828,716572,1,0,502,3.97898e+06,197,264,2433,3.59463e+06,553
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 77 transition count 99
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 77 transition count 99
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 77 transition count 98
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 70 transition count 91
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 69 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 68 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 68 transition count 88
Applied a total of 49 rules in 12 ms. Remains 68 /92 variables (removed 24) and now considering 88/129 (removed 41) transitions.
// Phase 1: matrix 88 rows 68 cols
[2024-05-21 18:56:04] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:56:04] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:56:04] [INFO ] Invariant cache hit.
[2024-05-21 18:56:04] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 18:56:05] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-21 18:56:05] [INFO ] Invariant cache hit.
[2024-05-21 18:56:05] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/156 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:56:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-05-21 18:56:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 101 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/156 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 87/188 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 188 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 4537ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4539ms
Starting structural reductions in LTL mode, iteration 1 : 68/92 places, 88/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4688 ms. Remains : 68/92 places, 88/129 transitions.
[2024-05-21 18:56:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:56:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:56:09] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-21 18:56:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:56:09] [INFO ] Time to serialize gal into /tmp/CTLFireability21369602530692810.gal : 2 ms
[2024-05-21 18:56:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2640893141804637424.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/CTLFireability21369602530692810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2640893141804637424.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.68858e+06,2.36075,72472,2,7968,5,289603,6,0,360,210023,0


Converting to forward existential form...Done !
original formula: AF((EG(EX(((p20<1)||(l115<1)))) + ((EG(((s1<1)||(l33<1))) * ((AG(((s1<1)||(l354<1))) + (s1<1)) + ((l7<1)||(l510<1)))) * ((EG(((s1<1)||(l3...211
=> equivalent forward existential formula: [FwdG(Init,!((EG(EX(((p20<1)||(l115<1)))) + ((EG(((s1<1)||(l33<1))) * ((!(E(TRUE U !(((s1<1)||(l354<1))))) + (s1...268
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t46, t47, t48, t49, t50, t51, t57, t65, t66, t67, t68, t69,...344
Using saturation style SCC detection
(forward)formula 0,1,18.7259,489220,1,0,570,2.57684e+06,225,272,2579,2.4002e+06,692
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 77 transition count 97
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 77 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 77 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 71 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 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 47 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 70 transition count 85
Applied a total of 49 rules in 11 ms. Remains 70 /92 variables (removed 22) and now considering 85/129 (removed 44) transitions.
// Phase 1: matrix 85 rows 70 cols
[2024-05-21 18:56:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:56:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:56:28] [INFO ] Invariant cache hit.
[2024-05-21 18:56:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:56:28] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-21 18:56:28] [INFO ] Invariant cache hit.
[2024-05-21 18:56:28] [INFO ] State equation strengthened by 25 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, 25/97 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/97 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 97 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 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, 25/97 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 84/181 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 181 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 3861ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3862ms
Starting structural reductions in LTL mode, iteration 1 : 70/92 places, 85/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4018 ms. Remains : 70/92 places, 85/129 transitions.
[2024-05-21 18:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:32] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-21 18:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4851086499269602518.gal : 2 ms
[2024-05-21 18:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability18383141025688041499.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/CTLFireability4851086499269602518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18383141025688041499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX(AX(((EF(((s1>=1)&&(l485>=1))) + (p38<1)) + (l136<1)))) * A(EF(EX(((s1>=1)&&(l484>=1)))) U ((s1>=1)&&(l339>=1))))
=> equivalent forward existential formula: ([(((EY(EY(Init)) * !((l136<1))) * !((p38<1))) * !(E(TRUE U ((s1>=1)&&(l485>=1)))))] = FALSE * ([((FwdU(Init,!((...302
Hit Full ! (commute/partial/dont) 1/0/84
(forward)formula 0,0,5.83977,142108,1,0,20,599388,20,4,1971,416239,16
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 78 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 78 transition count 101
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 69 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 69 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 69 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 68 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 68 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 67 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 67 transition count 88
Applied a total of 51 rules in 9 ms. Remains 67 /92 variables (removed 25) and now considering 88/129 (removed 41) transitions.
// Phase 1: matrix 88 rows 67 cols
[2024-05-21 18:56:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:56:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
[2024-05-21 18:56:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 18:56:38] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
[2024-05-21 18:56:38] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/155 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 102 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/155 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 31/102 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 87/189 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 189 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 4272ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4274ms
Starting structural reductions in LTL mode, iteration 1 : 67/92 places, 88/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4635 ms. Remains : 67/92 places, 88/129 transitions.
[2024-05-21 18:56:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:56:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:43] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-21 18:56:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:56:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14903791640290490811.gal : 2 ms
[2024-05-21 18:56:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3253228188694006775.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/CTLFireability14903791640290490811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3253228188694006775.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.92055e+06,1.93991,54308,2,9724,5,213166,6,0,356,185622,0


Converting to forward existential form...Done !
original formula: EG((A(!(EG(EF(((s1>=1)&&(l337>=1))))) U ((!(((s1>=1)&&(l91>=1))) * EX(((s9>=1)&&(l152>=1)))) + EF(EX(((p31>=1)&&(l0>=1)))))) + EG(((((s1<...307
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(((!(((s1>=1)&&(l91>=1))) * EX(((s9>=1)&&(l152>=1)))) + E(TRUE U EX(((p31>=1)&&(l0>=1)))))) U ...569
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t56, t65, t66, t67, t6...351
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 18:57:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:57:13] [INFO ] Applying decomposition
[2024-05-21 18:57:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15359946844693934900.txt' '-o' '/tmp/graph15359946844693934900.bin' '-w' '/tmp/graph15359946844693934900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15359946844693934900.bin' '-l' '-1' '-v' '-w' '/tmp/graph15359946844693934900.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:57:13] [INFO ] Decomposing Gal with order
[2024-05-21 18:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:57:13] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 18:57:13] [INFO ] Flatten gal took : 44 ms
[2024-05-21 18:57:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 6 ms.
[2024-05-21 18:57:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3024548182233034534.gal : 2 ms
[2024-05-21 18:57:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5230175154498076233.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/CTLFireability3024548182233034534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5230175154498076233.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.92055e+06,5.09423,141532,975,2646,56592,103112,228,443400,142,1.56603e+06,0


Converting to forward existential form...Done !
original formula: EG((A(!(EG(EF(((u0.s1>=1)&&(u0.l337>=1))))) U ((!(((u0.s1>=1)&&(u0.l91>=1))) * EX(((i2.u7.s9>=1)&&(i5.u8.l152>=1)))) + EF(EX(((i4.u9.p31>...401
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(((!(((u0.s1>=1)&&(u0.l91>=1))) * EX(((i2.u7.s9>=1)&&(i5.u8.l152>=1)))) + E(TRUE U EX(((i4.u9....717
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t25, t27, t28, t29, t30, t32, t33, t56, t65, t67, t69, t70, t71, t72, t73, t74, t...314
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 82 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 82 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 76 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 76 transition count 106
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 76 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 75 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 75 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 74 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 74 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 73 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 73 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 73 transition count 97
Applied a total of 42 rules in 5 ms. Remains 73 /92 variables (removed 19) and now considering 97/129 (removed 32) transitions.
// Phase 1: matrix 97 rows 73 cols
[2024-05-21 18:57:43] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:57:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 18:57:43] [INFO ] Invariant cache hit.
[2024-05-21 18:57:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 18:57:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 18:57:43] [INFO ] Invariant cache hit.
[2024-05-21 18:57:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 43/118 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:57:44] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:57:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 97/170 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 96/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 216 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 5500ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5501ms
Starting structural reductions in LTL mode, iteration 1 : 73/92 places, 97/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5655 ms. Remains : 73/92 places, 97/129 transitions.
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:57:49] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:57:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11957684431644516961.gal : 1 ms
[2024-05-21 18:57:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15935438543813895735.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/CTLFireability11957684431644516961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15935438543813895735.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,4.08456e+06,2.5429,71784,2,9723,5,273030,6,0,389,204276,0


Converting to forward existential form...Done !
original formula: ((E(((s1>=1)&&(l110>=1)) U !(E((((s1>=1)&&(l355>=1))||((s1>=1)&&(l491>=1))) U (((s1>=1)&&(l334>=1))||((s1>=1)&&(l336>=1)))))) * !(A(E((AX...447
=> equivalent forward existential formula: (([(Init * !(E(((s1>=1)&&(l110>=1)) U !(E((((s1>=1)&&(l355>=1))||((s1>=1)&&(l491>=1))) U (((s1>=1)&&(l334>=1))||...692
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, t50, t51, t52,...409
(forward)formula 0,1,27.0198,604168,1,0,537,3.48089e+06,251,228,2722,3.0127e+06,633
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 79 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 79 transition count 102
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 79 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 75 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 75 transition count 96
Applied a total of 36 rules in 13 ms. Remains 75 /92 variables (removed 17) and now considering 96/129 (removed 33) transitions.
// Phase 1: matrix 96 rows 75 cols
[2024-05-21 18:58:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:58:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 18:58:16] [INFO ] Invariant cache hit.
[2024-05-21 18:58:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 18:58:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 18:58:16] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-21 18:58:16] [INFO ] Invariant cache hit.
[2024-05-21 18:58:16] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/171 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 109 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/171 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 95/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 204 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 4421ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4422ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/92 places, 96/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4621 ms. Remains : 75/92 places, 96/129 transitions.
[2024-05-21 18:58:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:58:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:58:21] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 18:58:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:58:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7794050970062993981.gal : 1 ms
[2024-05-21 18:58:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15801834659109531327.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/CTLFireability7794050970062993981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15801834659109531327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF(((((s1>=1)&&(l339>=1))&&((l354>=1)&&(l486>=1)))&&((l502>=1)&&((s1<1)||(l490<1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((s1>=1)&&(l339>=1))&&((l354>=1)&&(l486>=1)))&&((l502>=1)&&((s1<1)||(l490<1))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t49, t50, t57, t58, t61, t62, t63, t70, t71, t72, t73, t74, t7...356
Detected timeout of ITS tools.
[2024-05-21 18:58:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:58:51] [INFO ] Applying decomposition
[2024-05-21 18:58:51] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14021844509739549142.txt' '-o' '/tmp/graph14021844509739549142.bin' '-w' '/tmp/graph14021844509739549142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14021844509739549142.bin' '-l' '-1' '-v' '-w' '/tmp/graph14021844509739549142.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:58:51] [INFO ] Decomposing Gal with order
[2024-05-21 18:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:58:51] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-21 18:58:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 4 ms.
[2024-05-21 18:58:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7582648157319888711.gal : 2 ms
[2024-05-21 18:58:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17007428972863250747.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/CTLFireability7582648157319888711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17007428972863250747.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.01659e+06,1.852,53160,1590,570,52598,7308,290,333313,92,51338,0


Converting to forward existential form...Done !
original formula: EG(EF(((((i0.u0.s1>=1)&&(i6.u10.l339>=1))&&((i6.u10.l354>=1)&&(i5.u13.l486>=1)))&&((i6.u14.l502>=1)&&((i0.u0.s1<1)||(i1.u4.l490<1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((i0.u0.s1>=1)&&(i6.u10.l339>=1))&&((i6.u10.l354>=1)&&(i5.u13.l486>=1)))&&((i6.u14.l502>=1...202
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t28, t49, t50, t57, t60, t61, t62, t63, t70, t71, t73, t74, t75, t76, t77, t78, t...353
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 78 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 78 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 78 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 72 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 72 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 71 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 71 transition count 92
Applied a total of 44 rules in 9 ms. Remains 71 /92 variables (removed 21) and now considering 92/129 (removed 37) transitions.
// Phase 1: matrix 92 rows 71 cols
[2024-05-21 18:59:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:59:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 18:59:21] [INFO ] Invariant cache hit.
[2024-05-21 18:59:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 18:59:21] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-21 18:59:21] [INFO ] Invariant cache hit.
[2024-05-21 18:59:21] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/163 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 103 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/163 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 91/194 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4857ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4858ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 92/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5018 ms. Remains : 71/92 places, 92/129 transitions.
[2024-05-21 18:59:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:59:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:59:26] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 18:59:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:59:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11710991006629326775.gal : 17 ms
[2024-05-21 18:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1830092215915517506.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/CTLFireability11710991006629326775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1830092215915517506.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(E(AF(EX((((s1>=1)&&(l3>=1))&&(l510>=1)))) U (A(!((((s1>=1)&&(l486>=1))||((p19>=1)&&(l126>=1)))) U AG(((s1>=1)&&(l125>=1)))) + !(((s1<1)...192
=> equivalent forward existential formula: [((Init * !(EG(!(((s1>=1)&&(l353>=1)))))) * !(E(!(((s1>=1)&&(l353>=1))) U (!(E(!(EG(!(EX((((s1>=1)&&(l3>=1))&&(l...428
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t48, t49, t50, t51, t52, t53, t60, t68, t69, t70, t71, t72,...349
(forward)formula 0,0,19.4431,516044,1,0,481,2.85935e+06,222,215,2697,2.25561e+06,566
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 76 transition count 96
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 76 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 33 place count 76 transition count 95
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 68 transition count 87
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 60 transition count 68
Applied a total of 72 rules in 11 ms. Remains 60 /92 variables (removed 32) and now considering 68/129 (removed 61) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 18:59:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:59:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:59:45] [INFO ] Invariant cache hit.
[2024-05-21 18:59:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:59:45] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 18:59:46] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-21 18:59:46] [INFO ] Invariant cache hit.
[2024-05-21 18:59:46] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 153 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2553ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2553ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/92 places, 68/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2691 ms. Remains : 60/92 places, 68/129 transitions.
[2024-05-21 18:59:48] [INFO ] Flatten gal took : 12 ms
[2024-05-21 18:59:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:59:48] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-21 18:59:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:59:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:59:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8942032628278718286.gal : 1 ms
[2024-05-21 18:59:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17743556365417743799.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/CTLFireability8942032628278718286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17743556365417743799.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,917228,1.4013,49492,2,10262,5,202275,6,0,308,154577,0


Converting to forward existential form...Done !
original formula: AF(AG(((s1>=1)&&(l491>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((s1>=1)&&(l491>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t42, t43, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...301
(forward)formula 0,0,4.67837,129936,1,0,150,556418,162,59,2173,459813,159
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 79 transition count 103
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 79 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 73 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 73 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 71 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 71 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 69 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 68 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 53 place count 68 transition count 84
Applied a total of 53 rules in 13 ms. Remains 68 /92 variables (removed 24) and now considering 84/129 (removed 45) transitions.
// Phase 1: matrix 84 rows 68 cols
[2024-05-21 18:59:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:59:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:59:53] [INFO ] Invariant cache hit.
[2024-05-21 18:59:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:59:53] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 18:59:53] [INFO ] Invariant cache hit.
[2024-05-21 18:59:53] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/152 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 104 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 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/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/152 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 83/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 187 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 4086ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4087ms
Starting structural reductions in LTL mode, iteration 1 : 68/92 places, 84/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4260 ms. Remains : 68/92 places, 84/129 transitions.
[2024-05-21 18:59:57] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:59:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:59:57] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 18:59:57] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:59:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:59:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14375981981176496648.gal : 4 ms
[2024-05-21 18:59:57] [INFO ] Time to serialize properties into /tmp/CTLFireability389850085744392231.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/CTLFireability14375981981176496648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability389850085744392231.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,3.44616e+06,1.48565,49756,2,7940,5,184704,6,0,356,163848,0


Converting to forward existential form...Done !
original formula: EX(EX(A(A((((s1>=1)&&(l491>=1))||((s1>=1)&&(l33>=1))) U !(((s1>=1)&&(l503>=1)))) U (((s1>=1)&&(l110>=1)) + ((EG(((s1>=1)&&(l488>=1))) * (...178
=> equivalent forward existential formula: [((EY(EY(Init)) * !(EG(!((((s1>=1)&&(l110>=1)) + ((EG(((s1>=1)&&(l488>=1))) * (s1>=1)) * (l91>=1))))))) * !(E(!(...478
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t43, t44, t45, t50, t51, t52, t54, t55, t56, t58, t59, t63,...354
Using saturation style SCC detection
(forward)formula 0,0,20.2353,581092,1,0,605,3.37735e+06,208,314,2507,2.93118e+06,643
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 76 transition count 98
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 76 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 67 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 67 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 53 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 64 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 60 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 60 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 70 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 59 transition count 69
Applied a total of 74 rules in 4 ms. Remains 59 /92 variables (removed 33) and now considering 69/129 (removed 60) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 19:00:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:00:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 19:00:18] [INFO ] Invariant cache hit.
[2024-05-21 19:00:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:00:18] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-21 19:00:18] [INFO ] Invariant cache hit.
[2024-05-21 19:00:18] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2488ms
Starting structural reductions in LTL mode, iteration 1 : 59/92 places, 69/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2659 ms. Remains : 59/92 places, 69/129 transitions.
[2024-05-21 19:00:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:00:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:00:20] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-21 19:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9384955577664392807.gal : 1 ms
[2024-05-21 19:00:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10757305082899913967.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/CTLFireability9384955577664392807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10757305082899913967.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,606618,0.511411,24548,2,7558,5,78527,6,0,305,79443,0


Converting to forward existential form...Done !
original formula: AF(EX(EF(EG(EX(((s1>=1)&&(l149>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U EG(EX(((s1>=1)&&(l149>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t45, t50, t51, t52, t5...331
Using saturation style SCC detection
(forward)formula 0,0,3.69676,122568,1,0,249,553343,167,117,2176,493699,259
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 76 transition count 94
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 76 transition count 93
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 67 transition count 84
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 64 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 64 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 59 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 62 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 60 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 60 transition count 71
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 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 59 transition count 66
Applied a total of 73 rules in 36 ms. Remains 59 /92 variables (removed 33) and now considering 66/129 (removed 63) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 19:00:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:00:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:00:24] [INFO ] Invariant cache hit.
[2024-05-21 19:00:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:00:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 19:00:24] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 19:00:24] [INFO ] Invariant cache hit.
[2024-05-21 19:00:24] [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, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 865 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: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1566 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: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2505ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2506ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/92 places, 66/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2701 ms. Remains : 59/92 places, 66/129 transitions.
[2024-05-21 19:00:27] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:00:27] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-21 19:00:27] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:27] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7276081083119172969.gal : 1 ms
[2024-05-21 19:00:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8051788724932912700.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7276081083119172969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8051788724932912700.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9185 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4104 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4030 steps, run visited all 1 properties in 6 ms. (steps per millisecond=671 )
Probabilistic random walk after 4030 steps, saw 1827 distinct states, run finished after 10 ms. (steps per millisecond=403 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-10 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 SI_CTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 77 transition count 97
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 77 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 31 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 66 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 64 transition count 78
Applied a total of 60 rules in 9 ms. Remains 64 /92 variables (removed 28) and now considering 78/129 (removed 51) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 19:00:27] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:00:27] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 19:00:27] [INFO ] Invariant cache hit.
[2024-05-21 19:00:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 19:00:27] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 19:00:27] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 19:00:27] [INFO ] Invariant cache hit.
[2024-05-21 19:00:27] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 90 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/167 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 167 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3366ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3368ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/92 places, 78/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3709 ms. Remains : 64/92 places, 78/129 transitions.
[2024-05-21 19:00:31] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:00:31] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-21 19:00:31] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:31] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1685011901118008896.gal : 1 ms
[2024-05-21 19:00:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6323631419053031420.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/CTLFireability1685011901118008896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6323631419053031420.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(((s1>=1)&&(l353>=1))) U (EG(!(((p37>=1)&&(l122>=1)))) + ((s1>=1)&&(l110>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(((p37>=1)&&(l122>=1)))) + ((s1>=1)&&(l110>=1))))))) * !(E(!((EG(!(((p37>=1)&&(l122>=1))))...283
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t41, t42, t48, t56, t57, t58, t59, t60, t61, t62, t63, t64, t6...316
Using saturation style SCC detection
(forward)formula 0,1,11.7917,334272,1,0,278,1.8706e+06,187,117,2376,1.5086e+06,327
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 79 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 79 transition count 98
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 71 transition count 90
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 71 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 71 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 70 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 47 place count 70 transition count 86
Applied a total of 47 rules in 2 ms. Remains 70 /92 variables (removed 22) and now considering 86/129 (removed 43) transitions.
// Phase 1: matrix 86 rows 70 cols
[2024-05-21 19:00:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:00:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:00:42] [INFO ] Invariant cache hit.
[2024-05-21 19:00:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:00:43] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-21 19:00:43] [INFO ] Invariant cache hit.
[2024-05-21 19:00:43] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 98 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 85/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 183 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 3607ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3608ms
Starting structural reductions in LTL mode, iteration 1 : 70/92 places, 86/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3764 ms. Remains : 70/92 places, 86/129 transitions.
[2024-05-21 19:00:46] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:00:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:00:46] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-21 19:00:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:00:46] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:00:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10206637224857230630.gal : 1 ms
[2024-05-21 19:00:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13906638863289128735.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/CTLFireability10206637224857230630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13906638863289128735.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EX(!(EX(((!((s1>=1)&&(l504>=1)))&&(((p24>=1)&&(l0>=1))||((p33>=1)&&(l0>=1))))))) U ((p37>=1)&&(l122>=1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(!(EX(((!((s1>=1)&&(l504>=1)))&&(((p24>=1)&&(l0>=1))||((p33>=1)&&(l0>=1)))))))) * ((p37>=1)&&(l122...171
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t52, t53, t54, t61, t62, t63, t64, t65, t66, t67, t68, t69, t7...331
(forward)formula 0,1,11.9169,325088,1,0,395,1.33351e+06,193,221,2549,1.85971e+06,415
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 78 transition count 103
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 78 transition count 103
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 70 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 70 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 46 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 68 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 68 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 66 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 65 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 65 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 58 place count 65 transition count 83
Applied a total of 58 rules in 2 ms. Remains 65 /92 variables (removed 27) and now considering 83/129 (removed 46) transitions.
// Phase 1: matrix 83 rows 65 cols
[2024-05-21 19:00:58] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 19:00:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:00:58] [INFO ] Invariant cache hit.
[2024-05-21 19:00:58] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:00:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-21 19:00:58] [INFO ] Invariant cache hit.
[2024-05-21 19:00:58] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/148 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 101 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 34/34 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/148 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 82/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 183 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 3427ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3428ms
Starting structural reductions in LTL mode, iteration 1 : 65/92 places, 83/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3598 ms. Remains : 65/92 places, 83/129 transitions.
[2024-05-21 19:01:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:01:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:01:02] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-21 19:01:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:01:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17503413091693843265.gal : 1 ms
[2024-05-21 19:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7352025529653134342.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/CTLFireability17503413091693843265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7352025529653134342.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.77502e+06,1.56723,53964,2,9820,5,199242,6,0,343,193004,0


Converting to forward existential form...Done !
original formula: EG(((EF(((s1<1)||(l355<1))) * EX(((E(((s1>=1)&&(l355>=1)) U ((s2>=1)&&(l497>=1))) + AF(((s4>=1)&&(l0>=1)))) + (((s1>=1)&&(l491>=1))||((s1...277
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((s1<1)||(l355<1))) * EX(((E(((s1>=1)&&(l355>=1)) U ((s2>=1)&&(l497>=1))) + !(EG(!(((s4>=1...407
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t52, t54, t55, t56, t6...356
(forward)formula 0,0,15.321,423828,1,0,404,2.2986e+06,216,173,2421,2.07287e+06,490
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 77 transition count 97
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 77 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 31 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 69 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 49 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 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 56 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 62 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 66 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 61 transition count 69
Applied a total of 70 rules in 8 ms. Remains 61 /92 variables (removed 31) and now considering 69/129 (removed 60) transitions.
// Phase 1: matrix 69 rows 61 cols
[2024-05-21 19:01:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:01:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:01:17] [INFO ] Invariant cache hit.
[2024-05-21 19:01:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:01:17] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 19:01:17] [INFO ] Redundant transitions in 0 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 19:01:17] [INFO ] Invariant cache hit.
[2024-05-21 19:01:17] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 88 constraints, problems are : Problem set: 0 solved, 68 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 68/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 156 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2606ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2606ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/92 places, 69/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2735 ms. Remains : 61/92 places, 69/129 transitions.
[2024-05-21 19:01:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:20] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-21 19:01:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11627519573093274463.gal : 0 ms
[2024-05-21 19:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13707352086733094943.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/CTLFireability11627519573093274463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13707352086733094943.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,924721,0.809559,31676,2,9259,5,105352,6,0,313,118404,0


Converting to forward existential form...Done !
original formula: AG(AF((EG(AF(((s1<1)||(l488<1)))) + EG(((s1>=1)&&(l37>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG(!(EG(!(((s1<1)||(l488<1)))))) + EG(((s1>=1)&&(l37>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t42, t43, t44, t45, t50, t51, t52, t53, t54, t55, t56, t5...311
(forward)formula 0,1,8.63208,276604,1,0,333,1.3956e+06,176,139,2164,1.47282e+06,377
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 129/129 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 79 transition count 105
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 72 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 72 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 70 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 70 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 69 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 68 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 68 transition count 87
Applied a total of 52 rules in 3 ms. Remains 68 /92 variables (removed 24) and now considering 87/129 (removed 42) transitions.
// Phase 1: matrix 87 rows 68 cols
[2024-05-21 19:01:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:01:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 19:01:29] [INFO ] Invariant cache hit.
[2024-05-21 19:01:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:01:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-21 19:01:29] [INFO ] Invariant cache hit.
[2024-05-21 19:01:29] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 33/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 103 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 33/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 86/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 189 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 3897ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3899ms
Starting structural reductions in LTL mode, iteration 1 : 68/92 places, 87/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 68/92 places, 87/129 transitions.
[2024-05-21 19:01:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:01:33] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:33] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-21 19:01:33] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:01:33] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:01:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17898520967910113034.gal : 1 ms
[2024-05-21 19:01:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13753278007182383558.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/CTLFireability17898520967910113034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13753278007182383558.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((E(((s1>=1)&&(l345>=1)) U A(EF(((s1>=1)&&(l345>=1))) U (((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1))))) + !(A((((s1>=1)&&(l149>=1))||((s1>...250
=> equivalent forward existential formula: [(FwdU(Init,(E(((s1>=1)&&(l345>=1)) U !((E(!((((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1)))) U (!(E(TRUE U ((s1>=1)...544
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t47, t48, t49, t55, t5...381
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:02:03] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:03] [INFO ] Applying decomposition
[2024-05-21 19:02:03] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12454318863379830005.txt' '-o' '/tmp/graph12454318863379830005.bin' '-w' '/tmp/graph12454318863379830005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12454318863379830005.bin' '-l' '-1' '-v' '-w' '/tmp/graph12454318863379830005.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:02:03] [INFO ] Decomposing Gal with order
[2024-05-21 19:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:02:03] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-21 19:02:03] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 4 ms.
[2024-05-21 19:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4449997168358403240.gal : 17 ms
[2024-05-21 19:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6022774351507231647.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/CTLFireability4449997168358403240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6022774351507231647.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21487e+06,1.16611,39608,1455,456,57034,2962,306,129602,76,17155,0


Converting to forward existential form...Done !
original formula: E((E(((i3.i0.u0.s1>=1)&&(i1.u1.l345>=1)) U A(EF(((i3.i0.u0.s1>=1)&&(i1.u1.l345>=1))) U (((i3.i0.u0.s1>=1)&&(i1.u1.l353>=1))||((u8.p24>=1)...392
=> equivalent forward existential formula: [(FwdU(Init,(E(((i3.i0.u0.s1>=1)&&(i1.u1.l345>=1)) U !((E(!((((i3.i0.u0.s1>=1)&&(i1.u1.l353>=1))||((u8.p24>=1)&&...806
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t47, t49, t55, t57, t58, t59, t60, t64, t65, t68, t69, t72, t73, t75, t76, t77, t79, ...395
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,14.1704,333408,1,0,436000,19248,1285,1.78678e+06,424,134997,790012
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 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.59879e+07,20.2661,407608,3762,754,269427,28114,381,3.42453e+06,91,567868,0


Converting to forward existential form...Done !
original formula: EG((A(!(EG(EF(((i0.u0.s1>=1)&&(i4.u11.l337>=1))))) U ((!(((i0.u0.s1>=1)&&(i3.u1.l91>=1))) * EX(((i3.u9.s9>=1)&&(i5.u13.l152>=1)))) + EF(E...444
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(((!(((i0.u0.s1>=1)&&(i3.u1.l91>=1))) * EX(((i3.u9.s9>=1)&&(i5.u13.l152>=1)))) + E(TRUE U EX((...782
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t7, t8, t9, t19, t26, t27, t29, t30, t31, t34, t57, t71, t72, t73, t75, t76, t77, t82...487
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,153.362,2210820,1,0,1.51336e+06,74464,975,2.14487e+07,317,1.0939e+06,778082
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF(((((i0.u0.s1>=1)&&(i5.u13.l339>=1))&&((i0.u15.l354>=1)&&(i6.u18.l486>=1)))&&((i5.u19.l502>=1)&&((i0.u0.s1<1)||(i1.u17.l490<1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((i0.u0.s1>=1)&&(i5.u13.l339>=1))&&((i0.u15.l354>=1)&&(i6.u18.l486>=1)))&&((i5.u19.l502>=1...203
(forward)formula 1,1,262.634,2432580,1,0,1.66892e+06,74464,975,2.2471e+07,317,1.0939e+06,321824
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 695539 ms.

BK_STOP 1716318400941

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m07"
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-d0m07, 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-171624189300458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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