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.r312-tall-171662339500874.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 ResAllocation-PT-R050C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500874
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 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 ResAllocation-PT-R050C002-CTLFireability-2024-00
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-01
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-02
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-03
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-04
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-05
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-06
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-07
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-08
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-09
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-10
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2024-11
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2023-12
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2023-13
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2023-14
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716718712184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-26 10:18:33] [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-26 10:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:18:33] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-26 10:18:33] [INFO ] Transformed 200 places.
[2024-05-26 10:18:33] [INFO ] Transformed 102 transitions.
[2024-05-26 10:18:33] [INFO ] Found NUPN structural information;
[2024-05-26 10:18:33] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 141 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2024-05-26 10:18:33] [INFO ] Computed 100 invariants in 17 ms
[2024-05-26 10:18:33] [INFO ] Implicit Places using invariants in 268 ms returned [107, 109, 115, 125, 131, 135, 139, 141, 147, 149, 159, 167, 177, 179, 181, 187, 191, 197]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 298 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/200 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 182/200 places, 102/102 transitions.
Support contains 141 out of 182 places after structural reductions.
[2024-05-26 10:18:34] [INFO ] Flatten gal took : 32 ms
[2024-05-26 10:18:34] [INFO ] Flatten gal took : 13 ms
[2024-05-26 10:18:34] [INFO ] Input system was already deterministic with 102 transitions.
Reduction of identical properties reduced properties to check from 72 to 68
RANDOM walk for 40000 steps (59 resets) in 2254 ms. (17 steps per ms) remains 19/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
// Phase 1: matrix 102 rows 182 cols
[2024-05-26 10:18:35] [INFO ] Computed 82 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 33/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 5/98 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 66/164 variables, 98/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 48/212 variables, 34/275 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 34/309 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 16/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 32/244 variables, 22/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 22/369 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 10/379 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 20/264 variables, 14/393 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/264 variables, 14/407 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/264 variables, 6/413 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/264 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (OVERLAPS) 11/275 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/275 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/275 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/275 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (OVERLAPS) 9/284 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/284 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/284 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/284 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 32 (OVERLAPS) 0/284 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 447 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1957 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 33/89 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 5/98 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 66/164 variables, 98/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 10/251 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 48/212 variables, 34/285 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 34/319 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 16/335 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 9/344 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:18:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-26 10:18:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/212 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/212 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/212 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 32/244 variables, 22/370 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 22/392 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/244 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/244 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/244 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/244 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/244 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 20/264 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/264 variables, 14/433 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/264 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/264 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 31 (OVERLAPS) 11/275 variables, 7/446 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/275 variables, 7/453 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/275 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/275 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 35 (OVERLAPS) 9/284 variables, 7/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/284 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/284 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/284 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 39 (OVERLAPS) 0/284 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 476 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5010 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 11/11 constraints]
After SMT, in 7019ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 12 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 182/182 places, 102/102 transitions.
RANDOM walk for 40000 steps (59 resets) in 368 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 453514 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :9 out of 19
Probabilistic random walk after 453514 steps, saw 119802 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :9
[2024-05-26 10:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 24/44 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 7/51 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 34/85 variables, 51/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 21/106 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 15/155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 7/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 14/120 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/120 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 6/126 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/126 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/126 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/126 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 6/132 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/132 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/132 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/132 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 6/138 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/138 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/138 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/138 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 6/144 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/144 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/144 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/144 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 5/149 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/149 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/149 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/149 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (OVERLAPS) 5/154 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/154 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/154 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/154 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (OVERLAPS) 6/160 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/160 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/160 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/160 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 6/166 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/166 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/166 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/166 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (OVERLAPS) 5/171 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/171 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/171 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/171 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (OVERLAPS) 5/176 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/176 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/176 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/176 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (OVERLAPS) 6/182 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/182 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/182 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/182 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (OVERLAPS) 5/187 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/187 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/187 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/187 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (OVERLAPS) 6/193 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/193 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/193 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/193 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (OVERLAPS) 5/198 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/198 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/198 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/198 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (OVERLAPS) 6/204 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/204 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/204 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/204 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (OVERLAPS) 6/210 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/210 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/210 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/210 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (OVERLAPS) 5/215 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/215 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/215 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/215 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (OVERLAPS) 6/221 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/221 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/221 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/221 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (OVERLAPS) 6/227 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/227 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/227 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/227 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (OVERLAPS) 6/233 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/233 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/233 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/233 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (OVERLAPS) 6/239 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/239 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/239 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/239 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 102 (OVERLAPS) 5/244 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/244 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/244 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/244 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 106 (OVERLAPS) 6/250 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/250 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/250 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/250 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 110 (OVERLAPS) 6/256 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/256 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/256 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/256 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 114 (OVERLAPS) 5/261 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/261 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/261 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/261 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 118 (OVERLAPS) 5/266 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/266 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/266 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/266 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 122 (OVERLAPS) 6/272 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/272 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/272 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/272 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 126 (OVERLAPS) 6/278 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/278 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/278 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/278 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 130 (OVERLAPS) 6/284 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/284 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/284 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/284 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 134 (OVERLAPS) 0/284 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 446 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2970 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 24/44 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 7/51 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 34/85 variables, 51/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 21/106 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 15/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/106 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-26 10:18:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:18:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/106 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/106 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 14/120 variables, 10/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 6/126 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/126 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/126 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/126 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 6/132 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/132 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/132 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/132 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 6/138 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/138 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/138 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/138 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 6/144 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/144 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/144 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/144 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 5/149 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/149 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/149 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/149 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (OVERLAPS) 5/154 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/154 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/154 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/154 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (OVERLAPS) 6/160 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/160 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/160 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/160 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 6/166 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/166 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/166 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/166 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (OVERLAPS) 5/171 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/171 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/171 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/171 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (OVERLAPS) 5/176 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/176 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/176 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/176 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (OVERLAPS) 6/182 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/182 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/182 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/182 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (OVERLAPS) 5/187 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/187 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/187 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/187 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 69 (OVERLAPS) 6/193 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/193 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/193 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/193 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 73 (OVERLAPS) 5/198 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/198 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/198 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/198 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 77 (OVERLAPS) 6/204 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/204 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/204 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/204 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 81 (OVERLAPS) 6/210 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/210 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/210 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/210 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 85 (OVERLAPS) 5/215 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/215 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/215 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/215 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 89 (OVERLAPS) 6/221 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/221 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/221 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/221 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 93 (OVERLAPS) 6/227 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/227 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/227 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/227 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 97 (OVERLAPS) 6/233 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/233 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/233 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/233 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 101 (OVERLAPS) 6/239 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/239 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/239 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-26 10:18:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 104 (INCLUDED_ONLY) 0/239 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/239 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 106 (OVERLAPS) 5/244 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/244 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/244 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/244 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 110 (OVERLAPS) 6/250 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/250 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/250 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/250 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 114 (OVERLAPS) 6/256 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/256 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/256 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/256 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 118 (OVERLAPS) 5/261 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/261 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/261 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/261 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 122 (OVERLAPS) 5/266 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/266 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/266 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/266 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 126 (OVERLAPS) 6/272 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/272 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/272 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/272 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 130 (OVERLAPS) 6/278 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/278 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/278 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/278 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 134 (OVERLAPS) 6/284 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/284 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/284 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/284 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 138 (OVERLAPS) 0/284 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 459 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7038 ms.
Refiners :[Domain max(s): 182/182 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 10016ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 3865 ms.
Support contains 12 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 180 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 180 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 178 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 176 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 176 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 174 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 172 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 172 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 170 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 169 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 169 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 167 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 166 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 166 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 28 place count 164 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 31 place count 162 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 162 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 160 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 37 place count 158 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 158 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 40 place count 156 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 42 place count 155 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 43 place count 155 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 45 place count 153 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 48 place count 151 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 49 place count 151 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 51 place count 149 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 54 place count 147 transition count 83
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 55 place count 147 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 57 place count 145 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 60 place count 143 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 61 place count 143 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 63 place count 141 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 66 place count 139 transition count 79
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 67 place count 139 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 69 place count 137 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 71 place count 136 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 72 place count 136 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 74 place count 134 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 77 place count 132 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 78 place count 132 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 80 place count 130 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 83 place count 128 transition count 73
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 84 place count 128 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 86 place count 126 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 88 place count 125 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 89 place count 125 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 91 place count 123 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 94 place count 121 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 95 place count 121 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 97 place count 119 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 99 place count 118 transition count 67
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 100 place count 118 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 102 place count 116 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 105 place count 114 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 106 place count 114 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 108 place count 112 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 110 place count 111 transition count 63
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 111 place count 111 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 113 place count 109 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 115 place count 108 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 116 place count 108 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 118 place count 106 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 3 rules applied. Total rules applied 121 place count 104 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 122 place count 104 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 124 place count 102 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 3 rules applied. Total rules applied 127 place count 100 transition count 57
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 128 place count 100 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 130 place count 98 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 132 place count 97 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 133 place count 97 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 135 place count 95 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 137 place count 94 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 138 place count 94 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 140 place count 92 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 3 rules applied. Total rules applied 143 place count 90 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 144 place count 90 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 146 place count 88 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 3 rules applied. Total rules applied 149 place count 86 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 150 place count 86 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 152 place count 84 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 3 rules applied. Total rules applied 155 place count 82 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 156 place count 82 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 158 place count 80 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 161 place count 78 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 162 place count 78 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 164 place count 76 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 166 place count 75 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 167 place count 75 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 169 place count 73 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 3 rules applied. Total rules applied 172 place count 71 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 173 place count 71 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 175 place count 69 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 3 rules applied. Total rules applied 178 place count 67 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 179 place count 67 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 181 place count 65 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 3 rules applied. Total rules applied 184 place count 63 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 185 place count 63 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 187 place count 61 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 189 place count 60 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 190 place count 60 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 192 place count 58 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 195 place count 56 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 196 place count 56 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 198 place count 54 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 3 rules applied. Total rules applied 201 place count 52 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 202 place count 52 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 204 place count 50 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 207 place count 48 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 208 place count 48 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 210 place count 46 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 3 rules applied. Total rules applied 213 place count 44 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 214 place count 44 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 216 place count 42 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 218 place count 41 transition count 25
Applied a total of 218 rules in 225 ms. Remains 41 /182 variables (removed 141) and now considering 25/102 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 41/182 places, 25/102 transitions.
RANDOM walk for 40000 steps (866 resets) in 308 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 408 steps (0 resets) in 4 ms. (81 steps per ms) remains 0/1 properties
[2024-05-26 10:18:59] [INFO ] Flatten gal took : 16 ms
[2024-05-26 10:18:59] [INFO ] Flatten gal took : 23 ms
[2024-05-26 10:18:59] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:18:59] [INFO ] Invariant cache hit.
[2024-05-26 10:18:59] [INFO ] Implicit Places using invariants in 197 ms returned [103, 109, 111, 120, 123, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 199 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 157/182 places, 102/102 transitions.
[2024-05-26 10:18:59] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:19:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:19:00] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:19:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:19:00] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:19:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15813133182228279244.gal : 3 ms
[2024-05-26 10:19:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8688423725656565453.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/CTLFireability15813133182228279244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8688423725656565453.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.92734e+16,0.132799,8216,2,416,5,22481,6,0,733,26898,0


Converting to forward existential form...Done !
original formula: E(((EG(A(EG((((r_0_10==1)&&(r_1_10==1))&&(p_1_11==1))) U (((p_0_35==1)&&(r_0_36==1))||((p_0_27==1)&&(r_0_28==1))))) * AF(((EG(EX(((p_0_23...599
=> equivalent forward existential formula: [(FwdU(Init,((EG(!((E(!((((p_0_35==1)&&(r_0_36==1))||((p_0_27==1)&&(r_0_28==1)))) U (!(EG((((r_0_10==1)&&(r_1_10...903
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:19:30] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:19:30] [INFO ] Applying decomposition
[2024-05-26 10:19:30] [INFO ] Flatten gal took : 7 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/graph5454687010313638986.txt' '-o' '/tmp/graph5454687010313638986.bin' '-w' '/tmp/graph5454687010313638986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5454687010313638986.bin' '-l' '-1' '-v' '-w' '/tmp/graph5454687010313638986.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:19:30] [INFO ] Decomposing Gal with order
[2024-05-26 10:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:19:30] [INFO ] Flatten gal took : 37 ms
[2024-05-26 10:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-26 10:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3043871920754102713.gal : 4 ms
[2024-05-26 10:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15087536785676359896.ctl : 5 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/CTLFireability3043871920754102713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15087536785676359896.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.091703,7660,109,10,10587,49,210,11788,20,74,0


Converting to forward existential form...Done !
original formula: E(((EG(A(EG((((i2.i0.u10.r_0_10==1)&&(i2.i0.u54.r_1_10==1))&&(i2.i0.u11.p_1_11==1))) U (((i7.i1.u35.p_0_35==1)&&(i7.i1.u36.r_0_36==1))||(...941
=> equivalent forward existential formula: [(FwdU(Init,((EG(!((E(!((((i7.i1.u35.p_0_35==1)&&(i7.i1.u36.r_0_36==1))||((i5.i1.u27.p_0_27==1)&&(i6.i0.u28.r_0_...1365
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t51, i10.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/reve...188
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:20:00] [INFO ] Invariant cache hit.
[2024-05-26 10:20:00] [INFO ] Implicit Places using invariants in 140 ms returned [101, 103, 105, 109, 111, 114, 116, 120, 125, 128, 131, 141, 143, 145, 147, 150, 154, 157, 159, 168, 170, 173, 178, 181]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 141 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 158/182 places, 102/102 transitions.
[2024-05-26 10:20:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:20:00] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:20:00] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:20:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:20:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12880699521706252686.gal : 2 ms
[2024-05-26 10:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1988300572719452167.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/CTLFireability12880699521706252686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1988300572719452167.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.92734e+16,0.117711,8580,2,420,5,23358,6,0,737,28028,0


Converting to forward existential form...Done !
original formula: AF((((EF((((r_0_31==0)||(r_1_31==0))||(p_1_32==0))) * (r_0_21==1)) * ((r_1_21==1)&&(p_1_22==1))) * (((AX(((p_0_4==1)&&(r_0_5==1))) + E(((...727
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (((r_0_31==0)||(r_1_31==0))||(p_1_32==0))) * (r_0_21==1)) * ((r_1_21==1)&&(p_1_22==1)))...1006
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:20:30] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:20:30] [INFO ] Applying decomposition
[2024-05-26 10:20:30] [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/graph18095243980858571285.txt' '-o' '/tmp/graph18095243980858571285.bin' '-w' '/tmp/graph18095243980858571285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18095243980858571285.bin' '-l' '-1' '-v' '-w' '/tmp/graph18095243980858571285.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:20:30] [INFO ] Decomposing Gal with order
[2024-05-26 10:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:20:30] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:20:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-26 10:20:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2871586313400673285.gal : 8 ms
[2024-05-26 10:20:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7698316152576951303.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/CTLFireability2871586313400673285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7698316152576951303.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.92734e+16,0.111084,8460,118,11,11938,44,219,14658,21,73,0


Converting to forward existential form...Done !
original formula: AF((((EF((((i6.i0.u31.r_0_31==0)||(i6.i0.u54.r_1_31==0))||(i6.i1.u32.p_1_32==0))) * (i4.i1.u21.r_0_21==1)) * ((i4.i1.u52.r_1_21==1)&&(i4....1161
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (((i6.i0.u31.r_0_31==0)||(i6.i0.u54.r_1_31==0))||(i6.i1.u32.p_1_32==0))) * (i4.i1.u21.r...1540
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/rever...187
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:21:00] [INFO ] Invariant cache hit.
[2024-05-26 10:21:00] [INFO ] Implicit Places using invariants in 115 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 128, 131, 135, 137, 141, 143, 147, 150, 152, 154, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 115 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 153/182 places, 102/102 transitions.
[2024-05-26 10:21:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:21:00] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:21:00] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:21:00] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:21:00] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:21:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14010237773312697345.gal : 1 ms
[2024-05-26 10:21:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8576035173579311634.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/CTLFireability14010237773312697345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8576035173579311634.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.92734e+16,0.115101,8292,2,405,5,22431,6,0,717,26885,0


Converting to forward existential form...Done !
original formula: EF((A((!(((p_0_46==1)&&(r_0_47==1))) + !(EG(((p_0_34==1)&&(r_0_35==1))))) U EG((((r_0_34==1)&&(r_1_34==1))&&(p_1_35==1)))) * EX((A((((r_0...302
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !((E(!(EG((((r_0_34==1)&&(r_1_34==1))&&(p_1_35==1)))) U (!((!(((p_0_46==1)&&(r_0_47==1...931
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:21:31] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:21:31] [INFO ] Applying decomposition
[2024-05-26 10:21:31] [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/graph4829149448650606488.txt' '-o' '/tmp/graph4829149448650606488.bin' '-w' '/tmp/graph4829149448650606488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4829149448650606488.bin' '-l' '-1' '-v' '-w' '/tmp/graph4829149448650606488.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:21:31] [INFO ] Decomposing Gal with order
[2024-05-26 10:21:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:21:31] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:21:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:21:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10234059562720053424.gal : 2 ms
[2024-05-26 10:21:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14721053455054524049.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/CTLFireability10234059562720053424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14721053455054524049.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.086422,7624,80,11,10117,41,192,10942,21,68,0


Converting to forward existential form...Done !
original formula: EF((A((!(((i9.i0.u46.p_0_46==1)&&(i9.i0.u47.r_0_47==1))) + !(EG(((i7.i0.u34.p_0_34==1)&&(i7.i1.u35.r_0_35==1))))) U EG((((i7.i0.u34.r_0_3...469
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !((E(!(EG((((i7.i0.u34.r_0_34==1)&&(i7.i0.u52.r_1_34==1))&&(i7.i1.u35.p_1_35==1)))) U ...1388
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:22:01] [INFO ] Invariant cache hit.
[2024-05-26 10:22:01] [INFO ] Implicit Places using invariants in 119 ms returned [101, 103, 105, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 134 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 153/182 places, 102/102 transitions.
[2024-05-26 10:22:01] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:22:01] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:22:01] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:22:01] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:22:01] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:22:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5660747355355144908.gal : 1 ms
[2024-05-26 10:22:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5418266115349579641.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/CTLFireability5660747355355144908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5418266115349579641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.1084,8300,2,404,5,22513,6,0,717,26843,0


Converting to forward existential form...Done !
original formula: !(A(EX(AG((((((r_0_5==1)&&(r_1_5==1))&&((p_1_6==1)&&(r_0_28==1)))&&((r_1_28==1)&&(p_1_29==1)))||((r_0_49==1)&&(r_1_49==1))))) U AF(((p_0_...178
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((p_0_31==1)&&(r_0_32==1))))))) * !(EX(!(E(TRUE U !((((((r_0_5==1)&&(r_1_5==1))&&((p_...347
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:22:31] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:22:31] [INFO ] Applying decomposition
[2024-05-26 10:22:31] [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/graph18005571266193440311.txt' '-o' '/tmp/graph18005571266193440311.bin' '-w' '/tmp/graph18005571266193440311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18005571266193440311.bin' '-l' '-1' '-v' '-w' '/tmp/graph18005571266193440311.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:22:31] [INFO ] Decomposing Gal with order
[2024-05-26 10:22:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:22:31] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:22:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability759301735885259852.gal : 2 ms
[2024-05-26 10:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability852146081594680429.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/CTLFireability759301735885259852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability852146081594680429.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 -...260
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.92734e+16,0.081192,7372,94,11,9771,42,196,10593,20,67,0


Converting to forward existential form...Done !
original formula: !(A(EX(AG((((((i0.i1.u5.r_0_5==1)&&(i0.i1.u50.r_1_5==1))&&((i1.i0.u6.p_1_6==1)&&(i6.i0.u28.r_0_28==1)))&&((i6.i0.u51.r_1_28==1)&&(i6.i0.u...276
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((i6.i1.u31.p_0_31==1)&&(i7.i0.u32.r_0_32==1))))))) * !(EX(!(E(TRUE U !((((((i0.i1.u5...485
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i2.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:23:01] [INFO ] Invariant cache hit.
[2024-05-26 10:23:01] [INFO ] Implicit Places using invariants in 110 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 143, 145, 147, 150, 152, 154, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 111 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 152/182 places, 102/102 transitions.
[2024-05-26 10:23:01] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:23:01] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:23:01] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:23:01] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:23:01] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16718645035447812537.gal : 1 ms
[2024-05-26 10:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15904901672836401385.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/CTLFireability16718645035447812537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15904901672836401385.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.92734e+16,0.10712,8288,2,402,5,22313,6,0,713,26754,0


Converting to forward existential form...Done !
original formula: (AF((EX((((r_0_25==0)||(r_1_25==0))||(p_1_26==0))) * AG(E(!(((p_0_27==1)&&(r_0_28==1))) U ((p_0_20==1)&&(r_0_21==1)))))) + AF(E(EX(!(EG((...291
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((EX((((r_0_25==0)||(r_1_25==0))||(p_1_26==0))) * !(E(TRUE U !(E(!(((p_0_27==1)&&(r_0_28==...363
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:23:31] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:23:31] [INFO ] Applying decomposition
[2024-05-26 10:23:31] [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/graph15162955951468625430.txt' '-o' '/tmp/graph15162955951468625430.bin' '-w' '/tmp/graph15162955951468625430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15162955951468625430.bin' '-l' '-1' '-v' '-w' '/tmp/graph15162955951468625430.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:23:31] [INFO ] Decomposing Gal with order
[2024-05-26 10:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:23:31] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5511983506870249066.gal : 6 ms
[2024-05-26 10:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2541997786517457797.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/CTLFireability5511983506870249066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2541997786517457797.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.92734e+16,0.07656,7104,67,11,8855,41,181,8928,21,67,0


Converting to forward existential form...Done !
original formula: (AF((EX((((i5.i0.u25.r_0_25==0)||(i5.i0.u50.r_1_25==0))||(i5.i1.u26.p_1_26==0))) * AG(E(!(((i5.i1.u27.p_0_27==1)&&(i5.i1.u28.r_0_28==1)))...445
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((EX((((i5.i0.u25.r_0_25==0)||(i5.i0.u50.r_1_25==0))||(i5.i1.u26.p_1_26==0))) * !(E(TRUE U...517
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i2.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:24:01] [INFO ] Invariant cache hit.
[2024-05-26 10:24:01] [INFO ] Implicit Places using invariants in 135 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 136 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 150/182 places, 102/102 transitions.
[2024-05-26 10:24:01] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:01] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:01] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:24:01] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:01] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3844796921734794637.gal : 1 ms
[2024-05-26 10:24:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11248970621150175595.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/CTLFireability3844796921734794637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11248970621150175595.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.92734e+16,0.120135,8284,2,396,5,21922,6,0,705,26276,0


Converting to forward existential form...Done !
original formula: EG(EX(EF(((p_0_1==0)||(r_0_2==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U ((p_0_1==0)||(r_0_2==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
(forward)formula 0,1,8.80683,272728,1,0,2168,1.47019e+06,231,2659,4839,2.41883e+06,2772
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:24:10] [INFO ] Invariant cache hit.
[2024-05-26 10:24:10] [INFO ] Implicit Places using invariants in 105 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 170, 173, 176, 178, 181]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 106 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 152/182 places, 102/102 transitions.
[2024-05-26 10:24:10] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:10] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:10] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:24:10] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:10] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16750694222988697540.gal : 1 ms
[2024-05-26 10:24:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15583867471442682228.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/CTLFireability16750694222988697540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15583867471442682228.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.92734e+16,0.108726,8288,2,402,5,22317,6,0,713,26738,0


Converting to forward existential form...Done !
original formula: EG(AG((EF((((r_0_41==1)&&(r_1_41==1))&&(p_1_42==1))) + AX(EF((((r_0_16==1)&&(r_1_16==1))&&(p_1_17==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((E(TRUE U (((r_0_41==1)&&(r_1_41==1))&&(p_1_42==1))) + !(EX(!(E(TRUE U (((r_0_16==1)&&(r...198
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
(forward)formula 0,0,0.692165,31876,1,0,401,169850,232,206,4898,160138,452
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:24:11] [INFO ] Invariant cache hit.
[2024-05-26 10:24:11] [INFO ] Implicit Places using invariants in 105 ms returned [101, 103, 105, 109, 111, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 105 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 151/182 places, 102/102 transitions.
[2024-05-26 10:24:11] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:11] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:11] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:24:11] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:11] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5813364285849114385.gal : 1 ms
[2024-05-26 10:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2509369950177516441.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/CTLFireability5813364285849114385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2509369950177516441.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.110183,8288,2,399,5,21984,6,0,709,26343,0


Converting to forward existential form...Done !
original formula: EX((E(EF(((p_0_17==1)&&(r_0_18==1))) U (((p_0_27==1)&&(r_0_28==1)) * (E(((p_0_9==1)&&(r_0_10==1)) U ((p_0_21==1)&&(r_0_22==1))) * EX((((r...228
=> equivalent forward existential formula: ([(EY(((FwdU(EY(Init),E(TRUE U ((p_0_17==1)&&(r_0_18==1)))) * ((p_0_27==1)&&(r_0_28==1))) * E(((p_0_9==1)&&(r_0_...302
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
(forward)formula 0,0,11.8978,386556,1,0,3093,2.13734e+06,245,2814,4884,3.4431e+06,4377
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:24:23] [INFO ] Invariant cache hit.
[2024-05-26 10:24:23] [INFO ] Implicit Places using invariants in 109 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 125, 128, 135, 137, 141, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 110 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 153/182 places, 102/102 transitions.
[2024-05-26 10:24:23] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:24:23] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:23] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:24:23] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:23] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6544573273006565177.gal : 4 ms
[2024-05-26 10:24:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15583272922174617954.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/CTLFireability6544573273006565177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15583272922174617954.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.92734e+16,0.113995,8288,2,405,5,22308,6,0,717,26741,0


Converting to forward existential form...Done !
original formula: AG(((AG((r_0_0==1)) + AX(AF((((r_0_13==0)||(r_1_13==0))||(p_1_14==0))))) + (EF(EX((((r_0_26==0)||(r_1_26==0))||(p_1_27==0)))) * (((r_0_18...190
=> equivalent forward existential formula: [FwdG(EY(((FwdU(Init,TRUE) * !((E(TRUE U EX((((r_0_26==0)||(r_1_26==0))||(p_1_27==0)))) * (((r_0_18==0)||(r_1_18...266
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Hit Full ! (commute/partial/dont) 97/7/5
(forward)formula 0,1,2.02368,76172,1,0,230,472388,239,114,5155,435186,233
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:24:25] [INFO ] Invariant cache hit.
[2024-05-26 10:24:26] [INFO ] Implicit Places using invariants in 119 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 122 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 150/182 places, 102/102 transitions.
[2024-05-26 10:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:26] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:24:26] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:24:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12836101126961443744.gal : 2 ms
[2024-05-26 10:24:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3375620465094552750.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/CTLFireability12836101126961443744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3375620465094552750.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.92734e+16,0.108239,8272,2,396,5,21922,6,0,705,26276,0


Converting to forward existential form...Done !
original formula: AX(EG(AF(((p_0_14==1)&&(r_0_15==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(((p_0_14==1)&&(r_0_15==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:24:56] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:24:56] [INFO ] Applying decomposition
[2024-05-26 10:24:56] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6932758795503468795.txt' '-o' '/tmp/graph6932758795503468795.bin' '-w' '/tmp/graph6932758795503468795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6932758795503468795.bin' '-l' '-1' '-v' '-w' '/tmp/graph6932758795503468795.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:24:56] [INFO ] Decomposing Gal with order
[2024-05-26 10:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:24:56] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:24:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6643222609628604461.gal : 2 ms
[2024-05-26 10:24:56] [INFO ] Time to serialize properties into /tmp/CTLFireability564135528979902166.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/CTLFireability6643222609628604461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability564135528979902166.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 -...261
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.92734e+16,0.081782,7332,58,11,9562,40,181,9824,21,66,0


Converting to forward existential form...Done !
original formula: AX(EG(AF(((i2.i1.u14.p_0_14==1)&&(i3.i0.u15.r_0_15==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(((i2.i1.u14.p_0_14==1)&&(i3.i0.u15.r_0_15==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:25:26] [INFO ] Invariant cache hit.
[2024-05-26 10:25:26] [INFO ] Implicit Places using invariants in 115 ms returned [101, 105, 109, 114, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 116 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 154/182 places, 102/102 transitions.
[2024-05-26 10:25:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:25:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:25:26] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:25:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:25:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:25:26] [INFO ] Time to serialize gal into /tmp/CTLFireability4599814058449791023.gal : 1 ms
[2024-05-26 10:25:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17475131873546575011.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/CTLFireability4599814058449791023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17475131873546575011.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.92734e+16,0.108723,8300,2,408,5,22260,6,0,721,26664,0


Converting to forward existential form...Done !
original formula: E(AX((AG((((r_0_6==1)&&(r_1_6==1))&&(p_1_7==1))) * (!(E(((p_0_46==1)&&(r_0_47==1)) U ((p_0_25==1)&&(r_0_26==1)))) + (((EX(((p_0_33==1)&&(...403
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(E(TRUE U !((((r_0_6==1)&&(r_1_6==1))&&(p_1_7==1))))) * (!(E(((p_0_46==1)&&(r_0_47==1)) U (...479
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:25:56] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:25:56] [INFO ] Applying decomposition
[2024-05-26 10:25:56] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5293136938040565902.txt' '-o' '/tmp/graph5293136938040565902.bin' '-w' '/tmp/graph5293136938040565902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5293136938040565902.bin' '-l' '-1' '-v' '-w' '/tmp/graph5293136938040565902.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:25:56] [INFO ] Decomposing Gal with order
[2024-05-26 10:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:25:56] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:25:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6482093574780709855.gal : 2 ms
[2024-05-26 10:25:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6335994068049897007.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/CTLFireability6482093574780709855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6335994068049897007.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.92734e+16,0.091966,7884,106,11,10811,43,213,12244,21,71,0


Converting to forward existential form...Done !
original formula: E(AX((AG((((i1.i0.u6.r_0_6==1)&&(i1.i0.u51.r_1_6==1))&&(i1.i0.u7.p_1_7==1))) * (!(E(((i9.i0.u46.p_0_46==1)&&(i9.i0.u47.r_0_47==1)) U ((i4...624
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(E(TRUE U !((((i1.i0.u6.r_0_6==1)&&(i1.i0.u51.r_1_6==1))&&(i1.i0.u7.p_1_7==1))))) * (!(E(((...700
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:26:26] [INFO ] Invariant cache hit.
[2024-05-26 10:26:26] [INFO ] Implicit Places using invariants in 117 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 118 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 150/182 places, 102/102 transitions.
[2024-05-26 10:26:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:26] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:26:26] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:26] [INFO ] Flatten gal took : 2 ms
[2024-05-26 10:26:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9068855356525440746.gal : 1 ms
[2024-05-26 10:26:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17168777685032919410.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/CTLFireability9068855356525440746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17168777685032919410.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.92734e+16,0.112603,8276,2,396,5,21922,6,0,705,26276,0


Converting to forward existential form...Done !
original formula: AX(AF(((p_0_11==1)&&(r_0_12==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((p_0_11==1)&&(r_0_12==1))))] = FALSE
Hit Full ! (commute/partial/dont) 97/0/5
(forward)formula 0,0,0.239747,12236,1,0,11,51110,20,4,3856,29108,9
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:26:26] [INFO ] Invariant cache hit.
[2024-05-26 10:26:27] [INFO ] Implicit Places using invariants in 110 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 110 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 150/182 places, 102/102 transitions.
[2024-05-26 10:26:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:27] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:26:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:26:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1127986440825422302.gal : 1 ms
[2024-05-26 10:26:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9870447263274888551.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/CTLFireability1127986440825422302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9870447263274888551.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.112845,8280,2,396,5,21922,6,0,705,26276,0


Converting to forward existential form...Done !
original formula: AX(EG(EF(((p_0_47==1)&&(r_0_48==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U ((p_0_47==1)&&(r_0_48==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-26 10:26:57] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:26:57] [INFO ] Applying decomposition
[2024-05-26 10:26:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17667581194030715714.txt' '-o' '/tmp/graph17667581194030715714.bin' '-w' '/tmp/graph17667581194030715714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17667581194030715714.bin' '-l' '-1' '-v' '-w' '/tmp/graph17667581194030715714.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:26:57] [INFO ] Decomposing Gal with order
[2024-05-26 10:26:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:26:57] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:26:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:26:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1037241601056920009.gal : 1 ms
[2024-05-26 10:26:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10179916704223447981.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/CTLFireability1037241601056920009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10179916704223447981.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.082221,7316,58,11,9430,38,175,9920,21,65,0


Converting to forward existential form...Done !
original formula: AX(EG(EF(((i8.i1.u47.p_0_47==1)&&(i8.i2.u48.r_0_48==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U ((i8.i1.u47.p_0_47==1)&&(i8.i2.u48.r_0_48==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i8.i2.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:27:27] [INFO ] Invariant cache hit.
[2024-05-26 10:27:27] [INFO ] Implicit Places using invariants in 117 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 120, 123, 125, 128, 131, 135, 137, 141, 143, 145, 147, 150, 152, 154, 157, 159, 161, 163, 168, 170, 173, 176, 178, 181]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 118 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 150/182 places, 102/102 transitions.
[2024-05-26 10:27:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:27] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:27:27] [INFO ] Flatten gal took : 2 ms
[2024-05-26 10:27:27] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11469047806902369506.gal : 1 ms
[2024-05-26 10:27:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6663123729578028119.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/CTLFireability11469047806902369506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6663123729578028119.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.92734e+16,0.113473,8280,2,396,5,21922,6,0,705,26276,0


Converting to forward existential form...Done !
original formula: EG(EX(((p_0_13==0)||(r_0_14==0))))
=> equivalent forward existential formula: [FwdG(Init,EX(((p_0_13==0)||(r_0_14==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
(forward)formula 0,1,9.67424,323464,1,0,2677,1.66212e+06,226,2658,4641,2.91517e+06,2767
FORMULA ResAllocation-PT-R050C002-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-26 10:27:37] [INFO ] Invariant cache hit.
[2024-05-26 10:27:37] [INFO ] Implicit Places using invariants in 117 ms returned [101, 103, 105, 109, 111, 114, 116, 118, 125, 128, 131, 135, 137, 141, 143, 145, 147, 152, 154, 161, 163, 168, 170, 176, 181]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 118 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/182 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 157 /157 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 157/182 places, 102/102 transitions.
[2024-05-26 10:27:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:37] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:27:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:27:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15694670170132286444.gal : 1 ms
[2024-05-26 10:27:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11206924892136212350.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/CTLFireability15694670170132286444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11206924892136212350.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.92734e+16,0.115868,8580,2,417,5,23405,6,0,733,28009,0


Converting to forward existential form...Done !
original formula: E((!((((((((p_0_5==1)&&(r_0_6==1))||((p_0_2==1)&&(r_0_3==1))) * EG(((p_0_29==1)&&(r_0_30==1)))) + !((((r_0_11==1)&&(r_1_11==1))&&(p_1_12=...667
=> equivalent forward existential formula: [(FwdU(Init,(!((((((((p_0_5==1)&&(r_0_6==1))||((p_0_2==1)&&(r_0_3==1))) * EG(((p_0_29==1)&&(r_0_30==1)))) + !(((...737
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-26 10:28:07] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:28:07] [INFO ] Applying decomposition
[2024-05-26 10:28:07] [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/graph14699028201205279469.txt' '-o' '/tmp/graph14699028201205279469.bin' '-w' '/tmp/graph14699028201205279469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14699028201205279469.bin' '-l' '-1' '-v' '-w' '/tmp/graph14699028201205279469.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:28:07] [INFO ] Decomposing Gal with order
[2024-05-26 10:28:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:28:07] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:28:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:28:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8064422661650589700.gal : 2 ms
[2024-05-26 10:28:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7802483437246539056.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/CTLFireability8064422661650589700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7802483437246539056.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.92734e+16,0.09245,7912,128,11,10612,44,232,12576,21,75,0


Converting to forward existential form...Done !
original formula: E((!((((((((i0.i2.u5.p_0_5==1)&&(i1.i0.u6.r_0_6==1))||((i0.i1.u2.p_0_2==1)&&(i0.i1.u3.r_0_3==1))) * EG(((i5.i1.u29.p_0_29==1)&&(i5.i1.u30...1053
=> equivalent forward existential formula: [(FwdU(Init,(!((((((((i0.i2.u5.p_0_5==1)&&(i1.i0.u6.r_0_6==1))||((i0.i1.u2.p_0_2==1)&&(i0.i1.u3.r_0_3==1))) * EG...1123
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 179 transition count 100
Applied a total of 5 rules in 11 ms. Remains 179 /182 variables (removed 3) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 179 cols
[2024-05-26 10:28:37] [INFO ] Computed 81 invariants in 5 ms
[2024-05-26 10:28:37] [INFO ] Implicit Places using invariants in 116 ms returned [100, 102, 106, 108, 111, 115, 117, 120, 122, 125, 128, 132, 134, 138, 140, 142, 144, 147, 149, 151, 154, 156, 158, 160, 165, 170, 173, 175, 178]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 117 ms to find 29 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/182 places, 100/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 131 ms. Remains : 150/182 places, 100/102 transitions.
[2024-05-26 10:28:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:28:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:28:37] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-26 10:28:37] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:28:37] [INFO ] Flatten gal took : 3 ms
[2024-05-26 10:28:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4611699521182994121.gal : 1 ms
[2024-05-26 10:28:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15097657957692551978.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/CTLFireability4611699521182994121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15097657957692551978.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.81475e+16,0.097824,8008,2,392,5,21239,6,0,703,25452,0


Converting to forward existential form...Done !
original formula: EG(AG((AG((((r_0_9==1)&&(r_1_9==1))&&(p_1_10==1))) + E(EF((((r_0_42==1)&&(r_1_42==1))&&(p_1_43==1))) U ((p_0_10==1)&&(r_0_11==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(E(TRUE U !((((r_0_9==1)&&(r_1_9==1))&&(p_1_10==1))))) + E(E(TRUE U (((r_0_42==1)&&(r_...224
Reverse transition relation is NOT exact ! Due to transitions t98, t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...170
(forward)formula 0,0,2.28716,95380,1,0,693,552217,233,432,4831,766738,646
FORMULA ResAllocation-PT-R050C002-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-26 10:28:39] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:28:39] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:28:39] [INFO ] Applying decomposition
[2024-05-26 10:28:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7098308067764056740.txt' '-o' '/tmp/graph7098308067764056740.bin' '-w' '/tmp/graph7098308067764056740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7098308067764056740.bin' '-l' '-1' '-v' '-w' '/tmp/graph7098308067764056740.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:28:39] [INFO ] Decomposing Gal with order
[2024-05-26 10:28:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:28:39] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:28:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:28:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1137017452406109922.gal : 2 ms
[2024-05-26 10:28:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11311998324343463978.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/CTLFireability1137017452406109922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11311998324343463978.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 9 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.92734e+16,0.133827,9996,236,10,14492,56,270,22133,19,92,0


Converting to forward existential form...Done !
original formula: E(((EG(A(EG((((i1.i1.u10.r_0_10==1)&&(i1.i1.u57.r_1_10==1))&&(i1.i1.u58.p_1_11==1))) U (((i6.i1.u35.p_0_35==1)&&(i6.i1.u36.r_0_36==1))||(...942
=> equivalent forward existential formula: [(FwdU(Init,((EG(!((E(!((((i6.i1.u35.p_0_35==1)&&(i6.i1.u36.r_0_36==1))||((i5.i0.u27.p_0_27==1)&&(i5.i1.u28.r_0_...1366
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t51, i8.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
[2024-05-26 10:52:02] [INFO ] Applying decomposition
[2024-05-26 10:52:02] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:52:02] [INFO ] Decomposing Gal with order
[2024-05-26 10:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:52:02] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5021219966240500790.gal : 2 ms
[2024-05-26 10:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability924681377972411561.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/CTLFireability5021219966240500790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability924681377972411561.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 -...261
No direction supplied, using forward translation only.
Parsed 9 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.92734e+16,0.108239,9764,238,13,15749,239,381,13473,19,189,0


Converting to forward existential form...Done !
original formula: E(((EG(A(EG((((u40.r_0_10==1)&&(u61.r_1_10==1))&&(u39.p_1_11==1))) U (((u15.p_0_35==1)&&(u14.r_0_36==1))||((u23.p_0_27==1)&&(u22.r_0_28==...739
=> equivalent forward existential formula: [(FwdU(Init,((EG(!((E(!((((u15.p_0_35==1)&&(u14.r_0_36==1))||((u23.p_0_27==1)&&(u22.r_0_28==1)))) U (!(EG((((u40...1091
Reverse transition relation is NOT exact ! Due to transitions t51, u1.t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...174
Fast SCC detection found an SCC at level 81
(forward)formula 0,1,94.5397,2200160,1,0,5.64388e+06,239,1454,7.15532e+06,55,189,8665883
FORMULA ResAllocation-PT-R050C002-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2024-05-26 10:55:21] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:55:21] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-26 10:55:21] [INFO ] Transformed 182 places.
[2024-05-26 10:55:21] [INFO ] Transformed 102 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 10:55:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14527944117994407858.gal : 1 ms
[2024-05-26 10:55:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8514382102756312462.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/CTLFireability14527944117994407858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8514382102756312462.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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.92734e+16,0.13916,9752,2,694,5,28464,6,0,833,35640,0


Converting to forward existential form...Done !
original formula: AF((((EF((((r_0_31==0)||(r_1_31==0))||(p_1_32==0))) * (r_0_21==1)) * ((r_1_21==1)&&(p_1_22==1))) * (((AX(((p_0_4==1)&&(r_0_5==1))) + E(((...727
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (((r_0_31==0)||(r_1_31==0))||(p_1_32==0))) * (r_0_21==1)) * ((r_1_21==1)&&(p_1_22==1)))...1006
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Using saturation style SCC detection
ITS-tools command line returned an error code 137
Total runtime 3352464 ms.

BK_STOP 1716722065814

--------------------
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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r312-tall-171662339500874"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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