About the Execution of ITS-Tools for TokenRing-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1999.520 | 606023.00 | 682873.00 | 2188.90 | FTTTTTFFFFFFTFFT | normal |
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.r422-smll-171690573700161.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 TokenRing-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r422-smll-171690573700161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K 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 TokenRing-PT-010-CTLCardinality-2024-00
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-01
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-02
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-03
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-04
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-05
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-06
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-07
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-08
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-09
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-10
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-11
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-12
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-13
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-14
FORMULA_NAME TokenRing-PT-010-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717004562223
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 17:42:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:42:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:42:45] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2024-05-29 17:42:45] [INFO ] Transformed 121 places.
[2024-05-29 17:42:45] [INFO ] Transformed 1111 transitions.
[2024-05-29 17:42:45] [INFO ] Found NUPN structural information;
[2024-05-29 17:42:45] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 182 ms.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-010-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 66 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-05-29 17:42:46] [INFO ] Computed 11 invariants in 32 ms
[2024-05-29 17:42:46] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-05-29 17:42:46] [INFO ] Invariant cache hit.
[2024-05-29 17:42:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:42:48] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:42:48] [INFO ] Invariant cache hit.
[2024-05-29 17:42:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:42:57] [INFO ] Deduced a trap composed of 66 places in 325 ms of which 33 ms to minimize.
[2024-05-29 17:42:58] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 4 ms to minimize.
[2024-05-29 17:42:58] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:42:58] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:42:58] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:42:59] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
[2024-05-29 17:42:59] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 4 ms to minimize.
[2024-05-29 17:42:59] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:42:59] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:43:00] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 6 ms to minimize.
[2024-05-29 17:43:00] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:43:00] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:43:00] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:43:00] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2024-05-29 17:43:01] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-29 17:43:01] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 2 ms to minimize.
[2024-05-29 17:43:01] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:43:01] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:43:01] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:43:02] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:43:03] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:43:03] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:43:03] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:43:04] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:43:04] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:43:04] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:43:04] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 3 ms to minimize.
[2024-05-29 17:43:05] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:43:05] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:43:05] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 4 ms to minimize.
[2024-05-29 17:43:05] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:43:06] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:43:06] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:43:06] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-05-29 17:43:06] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:43:07] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:43:07] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
[2024-05-29 17:43:07] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:43:07] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:43:08] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:43:16] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:43:16] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:43:16] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:43:17] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:43:17] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 3 ms to minimize.
[2024-05-29 17:43:17] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:43:17] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:43:18] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:43:18] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:43:18] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:43:18] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 4 ms to minimize.
[2024-05-29 17:43:19] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:43:19] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:43:19] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:43:19] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:43:20] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
SMT process timed out in 31695ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31758ms
Finished structural reductions in LTL mode , in 1 iterations and 34326 ms. Remains : 121/121 places, 1111/1111 transitions.
Support contains 53 out of 121 places after structural reductions.
[2024-05-29 17:43:20] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-29 17:43:20] [INFO ] Flatten gal took : 201 ms
[2024-05-29 17:43:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-010-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:43:20] [INFO ] Flatten gal took : 138 ms
[2024-05-29 17:43:21] [INFO ] Input system was already deterministic with 1111 transitions.
Support contains 42 out of 121 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1432 ms. (27 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40000 steps (8 resets) in 565 ms. (70 steps per ms) remains 1/1 properties
[2024-05-29 17:43:21] [INFO ] Invariant cache hit.
[2024-05-29 17:43:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/242 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 310/552 variables, 400/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/627 variables, 44/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 44/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 400/1027 variables, 310/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1027 variables, 80/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1027 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 84/1111 variables, 44/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 44/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 4/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1111 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1111 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/1221 variables, 200/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1221 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/1232 variables, 11/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1232 variables, 11/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1232 variables, 1/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/242 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 310/552 variables, 400/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/627 variables, 44/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 44/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 400/1027 variables, 310/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1027 variables, 80/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1027 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/1111 variables, 44/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 44/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1111 variables, 4/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1111 variables, 20/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 110/1221 variables, 200/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1221 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 11/1232 variables, 11/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1232 variables, 11/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1232 variables, 1/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1232 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1232 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 1264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1188 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 73 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 569 ms. (70 steps per ms) remains 1/1 properties
Probably explored full state space saw : 58904 states, properties seen :0
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 2248 ms. (steps per millisecond=157 ) properties seen :0
Explored full state space saw : 58905 states, properties seen :0
Exhaustive walk after 352955 steps, saw 58905 distinct states, run finished after 2042 ms. (steps per millisecond=172 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2024-05-29 17:43:29] [INFO ] Flatten gal took : 51 ms
[2024-05-29 17:43:29] [INFO ] Flatten gal took : 50 ms
[2024-05-29 17:43:29] [INFO ] Input system was already deterministic with 1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 12 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:43:29] [INFO ] Invariant cache hit.
[2024-05-29 17:43:29] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 17:43:29] [INFO ] Invariant cache hit.
[2024-05-29 17:43:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:43:31] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:43:31] [INFO ] Invariant cache hit.
[2024-05-29 17:43:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:43:39] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:43:40] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:43:40] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:43:40] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:43:40] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:43:41] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
[2024-05-29 17:43:41] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:43:41] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 4 ms to minimize.
[2024-05-29 17:43:41] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:43:42] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:43:42] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:43:42] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:43:43] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:43:43] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:43:43] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:43:43] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:43:44] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:43:44] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:43:44] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:43:44] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:43:46] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:43:46] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:43:46] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:43:47] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:43:47] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:43:47] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:43:47] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:43:48] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:43:48] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:43:48] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:43:48] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:43:49] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:43:49] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:43:49] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:43:49] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:43:50] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:43:50] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:43:50] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:43:50] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:43:51] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:43:58] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:43:58] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:43:59] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:43:59] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:43:59] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:43:59] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:44:00] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:44:00] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:44:00] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:44:00] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:44:01] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 3 ms to minimize.
[2024-05-29 17:44:01] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:44:01] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:44:02] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:44:02] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:44:02] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
SMT process timed out in 31345ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31369ms
Finished structural reductions in LTL mode , in 1 iterations and 33273 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:44:02] [INFO ] Flatten gal took : 59 ms
[2024-05-29 17:44:02] [INFO ] Flatten gal took : 63 ms
[2024-05-29 17:44:02] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:44:02] [INFO ] Flatten gal took : 65 ms
[2024-05-29 17:44:03] [INFO ] Flatten gal took : 56 ms
[2024-05-29 17:44:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2651937878851105432.gal : 56 ms
[2024-05-29 17:44:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7865760325176032150.ctl : 4 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/CTLCardinality2651937878851105432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7865760325176032150.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,58905,1.97277,46340,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,1,6.76961,143408,1,0,982,338423,1461,342,12379,279678,1454
FORMULA TokenRing-PT-010-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:44:10] [INFO ] Invariant cache hit.
[2024-05-29 17:44:10] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-29 17:44:10] [INFO ] Invariant cache hit.
[2024-05-29 17:44:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:44:12] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:44:12] [INFO ] Invariant cache hit.
[2024-05-29 17:44:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:44:19] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:44:19] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:44:20] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:44:20] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:44:20] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:44:21] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:44:21] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:44:21] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:44:21] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:44:22] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:44:22] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:44:22] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:44:23] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:44:23] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:44:23] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:44:23] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:44:23] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:44:24] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:44:24] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:44:24] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:44:25] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2024-05-29 17:44:25] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-29 17:44:25] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:44:26] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:44:26] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
[2024-05-29 17:44:26] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:44:26] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-05-29 17:44:26] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:44:27] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:44:27] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:44:27] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:44:27] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:44:28] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:44:28] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:44:28] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:44:28] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:44:29] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:44:29] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:44:29] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:44:29] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:44:35] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:44:36] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:44:36] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:44:36] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:44:37] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 3 ms to minimize.
[2024-05-29 17:44:37] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:44:37] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:44:37] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:44:39] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:44:39] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:44:39] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:44:39] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:44:40] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 3 ms to minimize.
[2024-05-29 17:44:40] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:44:40] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:44:41] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:44:43] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:44:43] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
SMT process timed out in 31348ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31383ms
Finished structural reductions in LTL mode , in 1 iterations and 33396 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:44:43] [INFO ] Flatten gal took : 50 ms
[2024-05-29 17:44:43] [INFO ] Flatten gal took : 52 ms
[2024-05-29 17:44:43] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:44:43] [INFO ] Flatten gal took : 55 ms
[2024-05-29 17:44:43] [INFO ] Flatten gal took : 49 ms
[2024-05-29 17:44:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13723367393927906057.gal : 17 ms
[2024-05-29 17:44:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15924278274724731184.ctl : 3 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/CTLCardinality13723367393927906057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15924278274724731184.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,58905,2.00386,46668,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(((EG(((A(((State_3_10==0)||(State_6_9==1)) U ((State_0_1==0)||(State_4_5==1))) * (State_2_9==0)) * ((State_10_10==1)&&((State_6_0==0)|...413
=> equivalent forward existential formula: (([FwdG(EY(Init),((!((E(!(((State_0_1==0)||(State_4_5==1))) U (!(((State_3_10==0)||(State_6_9==1))) * !(((State_...778
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 17:45:13] [INFO ] Flatten gal took : 44 ms
[2024-05-29 17:45:13] [INFO ] Applying decomposition
[2024-05-29 17:45:13] [INFO ] Flatten gal took : 44 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/graph7005029582846366990.txt' '-o' '/tmp/graph7005029582846366990.bin' '-w' '/tmp/graph7005029582846366990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7005029582846366990.bin' '-l' '-1' '-v' '-w' '/tmp/graph7005029582846366990.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:45:14] [INFO ] Decomposing Gal with order
[2024-05-29 17:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:45:14] [INFO ] Removed a total of 2358 redundant transitions.
[2024-05-29 17:45:14] [INFO ] Flatten gal took : 245 ms
[2024-05-29 17:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 31 ms.
[2024-05-29 17:45:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1546947536457167304.gal : 16 ms
[2024-05-29 17:45:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14899175082072813711.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/CTLCardinality1546947536457167304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14899175082072813711.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,58905,6.5401,154880,1806,14,253554,232,1538,288768,17,778,0
Converting to forward existential form...Done !
original formula: EX(((EG(((A(((i0.u20.State_3_10==0)||(i4.i7.u31.State_6_9==1)) U ((i2.i3.u45.State_0_1==0)||(i2.i2.u9.State_4_5==1))) * (i2.i1.u6.State_2...602
=> equivalent forward existential formula: (([FwdG(EY(Init),((!((E(!(((i2.i3.u45.State_0_1==0)||(i2.i2.u9.State_4_5==1))) U (!(((i0.u20.State_3_10==0)||(i4...1065
Reverse transition relation is NOT exact ! Due to transitions t4, t29, t33, t56, t62, t91, t103, t109, t126, t136, t144, t150, t167, t190, t195, t253, t272...2873
(forward)formula 0,0,29.9338,665192,1,0,1.03143e+06,293,8290,3.15554e+06,67,1884,2323017
FORMULA TokenRing-PT-010-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 40 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:45:44] [INFO ] Invariant cache hit.
[2024-05-29 17:45:45] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-29 17:45:45] [INFO ] Invariant cache hit.
[2024-05-29 17:45:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:45:47] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
[2024-05-29 17:45:47] [INFO ] Redundant transitions in 128 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:45:47] [INFO ] Invariant cache hit.
[2024-05-29 17:45:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:45:55] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 3 ms to minimize.
[2024-05-29 17:45:55] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:45:55] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:45:56] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:45:56] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:45:56] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:45:57] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:45:57] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:45:57] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:45:57] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:45:58] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:45:58] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:45:58] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:45:58] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:45:59] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:45:59] [INFO ] Deduced a trap composed of 62 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:45:59] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:45:59] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:46:00] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:46:00] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:46:01] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:46:01] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:46:02] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:46:02] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:46:02] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:46:03] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:46:03] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:46:03] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:46:03] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:46:04] [INFO ] Deduced a trap composed of 65 places in 348 ms of which 2 ms to minimize.
[2024-05-29 17:46:04] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 2 ms to minimize.
[2024-05-29 17:46:04] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:46:04] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:46:05] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:46:05] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:46:05] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:46:05] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:46:06] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:46:06] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:46:06] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:46:13] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:46:14] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:46:14] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:46:14] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:46:14] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:46:15] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:46:15] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:46:15] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:46:16] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:46:16] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:46:16] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:46:16] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:46:17] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:46:17] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:46:17] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:46:17] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 4 ms to minimize.
[2024-05-29 17:46:18] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:46:18] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:46:18] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:46:18] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 2 ms to minimize.
SMT process timed out in 31455ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31477ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34086 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:46:19] [INFO ] Flatten gal took : 39 ms
[2024-05-29 17:46:19] [INFO ] Flatten gal took : 43 ms
[2024-05-29 17:46:19] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:46:19] [INFO ] Flatten gal took : 78 ms
[2024-05-29 17:46:19] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:46:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2369320228422280311.gal : 9 ms
[2024-05-29 17:46:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality18379766569870554757.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/CTLCardinality2369320228422280311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18379766569870554757.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,58905,2.00964,46696,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EG((State_5_9==0))
=> equivalent forward existential formula: [FwdG(Init,(State_5_9==0))] != FALSE
Hit Full ! (commute/partial/dont) 1081/0/30
(forward)formula 0,0,9.98731,237960,1,0,63,536409,19,2,8273,296657,63
FORMULA TokenRing-PT-010-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 16 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:46:29] [INFO ] Invariant cache hit.
[2024-05-29 17:46:29] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-29 17:46:29] [INFO ] Invariant cache hit.
[2024-05-29 17:46:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:46:31] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:46:31] [INFO ] Invariant cache hit.
[2024-05-29 17:46:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:46:38] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:46:38] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:46:38] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:46:39] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:46:39] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:46:39] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:46:39] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:46:40] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 5 ms to minimize.
[2024-05-29 17:46:40] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:46:40] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:46:40] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:46:41] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:46:41] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:46:41] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:46:41] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:46:41] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:46:42] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:46:42] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 4 ms to minimize.
[2024-05-29 17:46:42] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 4 ms to minimize.
[2024-05-29 17:46:43] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:46:43] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-29 17:46:44] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 7 ms to minimize.
[2024-05-29 17:46:44] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:46:44] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 17:46:44] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:46:45] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:46:45] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:46:45] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:46:46] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:46:46] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:46:46] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:46:46] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:46:47] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:46:47] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:46:47] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:46:47] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:46:48] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:46:48] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:46:48] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:46:49] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:46:57] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:46:57] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:46:57] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:46:57] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:46:58] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:46:58] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:46:58] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:46:58] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:46:59] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:46:59] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:46:59] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:47:00] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:47:00] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:47:00] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:47:00] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:47:01] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:47:01] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:47:01] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:47:01] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:47:02] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30070 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:47:06] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:47:07] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:47:07] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:47:07] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:47:07] [INFO ] Deduced a trap composed of 63 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:47:08] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:47:08] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:47:08] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:47:08] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:47:09] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:47:09] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:47:09] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:47:10] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:47:10] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:47:10] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:47:10] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:47:10] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:47:13] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 63 places in 297 ms of which 3 ms to minimize.
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:47:18] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:47:18] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:47:18] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:47:18] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:47:21] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 2 ms to minimize.
[2024-05-29 17:47:21] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:47:22] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:47:22] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:47:22] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 5 ms to minimize.
[2024-05-29 17:47:22] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:47:24] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:47:24] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 3 ms to minimize.
[2024-05-29 17:47:24] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:47:24] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:47:25] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:47:25] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:47:25] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:47:26] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:47:26] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 11 ms to minimize.
[2024-05-29 17:47:26] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:47:29] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-05-29 17:47:29] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2024-05-29 17:47:29] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:47:30] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:47:30] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 1 ms to minimize.
[2024-05-29 17:47:30] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 1 ms to minimize.
[2024-05-29 17:47:30] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 2 ms to minimize.
[2024-05-29 17:47:30] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:47:31] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 1 ms to minimize.
[2024-05-29 17:47:31] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:47:31] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:47:31] [INFO ] Deduced a trap composed of 67 places in 214 ms of which 3 ms to minimize.
[2024-05-29 17:47:32] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:47:32] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:47:32] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 1 ms to minimize.
SMT process timed out in 61111ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61125ms
Finished structural reductions in LTL mode , in 1 iterations and 63086 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:47:32] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:47:32] [INFO ] Flatten gal took : 40 ms
[2024-05-29 17:47:32] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:47:32] [INFO ] Flatten gal took : 39 ms
[2024-05-29 17:47:32] [INFO ] Flatten gal took : 40 ms
[2024-05-29 17:47:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13834000559182588403.gal : 7 ms
[2024-05-29 17:47:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8687721780644050757.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/CTLCardinality13834000559182588403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8687721780644050757.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,58905,2.16342,46700,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(AX(EF((AX((State_6_1==1)) * EG((State_1_2==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U (!(EX(!((State_6_1==1)))) * EG((State_1_2==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,0,12.7291,275468,1,0,1068,658362,1472,354,12490,461624,1557
FORMULA TokenRing-PT-010-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 12 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:47:45] [INFO ] Invariant cache hit.
[2024-05-29 17:47:46] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-29 17:47:46] [INFO ] Invariant cache hit.
[2024-05-29 17:47:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:47:47] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:47:47] [INFO ] Invariant cache hit.
[2024-05-29 17:47:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:47:55] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:47:55] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:47:55] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:47:56] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:47:56] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:47:56] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:47:56] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:47:57] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:47:57] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:47:57] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:47:58] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:47:58] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 3 ms to minimize.
[2024-05-29 17:47:58] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:47:58] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:47:59] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:47:59] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:47:59] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:47:59] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:48:00] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:48:00] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:01] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-05-29 17:48:01] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2024-05-29 17:48:01] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:48:01] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
[2024-05-29 17:48:02] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2024-05-29 17:48:02] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:48:02] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:48:02] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:48:03] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:48:03] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:48:03] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:48:03] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:48:04] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:48:04] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:48:04] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:48:04] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:48:05] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:48:05] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:48:05] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:48:05] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:13] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 3 ms to minimize.
[2024-05-29 17:48:13] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:48:13] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:48:13] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 3 ms to minimize.
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:48:16] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:48:16] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:48:16] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:48:16] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:48:17] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:48:17] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 3 ms to minimize.
[2024-05-29 17:48:17] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 2 ms to minimize.
[2024-05-29 17:48:18] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30025 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:22] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:48:22] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:48:22] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:48:23] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:48:23] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:48:23] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:48:23] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:48:24] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 2 ms to minimize.
[2024-05-29 17:48:24] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:48:24] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:48:24] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:48:25] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:48:25] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:48:25] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:48:25] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 5 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:48:27] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 3 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2024-05-29 17:48:33] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:48:33] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:48:33] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:48:33] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:36] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 1 ms to minimize.
[2024-05-29 17:48:36] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2024-05-29 17:48:36] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 1 ms to minimize.
[2024-05-29 17:48:36] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2024-05-29 17:48:37] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 2 ms to minimize.
[2024-05-29 17:48:37] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:48:37] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:48:37] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 3 ms to minimize.
[2024-05-29 17:48:37] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:48:38] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:48:38] [INFO ] Deduced a trap composed of 69 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:48:38] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:48:39] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:48:39] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:48:39] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:48:39] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 1 ms to minimize.
[2024-05-29 17:48:39] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 2 ms to minimize.
[2024-05-29 17:48:40] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 1 ms to minimize.
[2024-05-29 17:48:40] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-05-29 17:48:40] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:48:42] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2024-05-29 17:48:43] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2024-05-29 17:48:43] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:48:43] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:48:43] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:48:43] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-05-29 17:48:44] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2024-05-29 17:48:44] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:48:44] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
[2024-05-29 17:48:45] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:48:45] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:48:45] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:48:45] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:48:46] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:48:46] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:48:46] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:48:46] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:48:47] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:48:47] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:48:47] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30039 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60987ms
Finished structural reductions in LTL mode , in 1 iterations and 63246 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:48:48] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:48:48] [INFO ] Flatten gal took : 40 ms
[2024-05-29 17:48:49] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:48:49] [INFO ] Flatten gal took : 39 ms
[2024-05-29 17:48:49] [INFO ] Flatten gal took : 44 ms
[2024-05-29 17:48:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2949721724210297131.gal : 7 ms
[2024-05-29 17:48:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10743345990378183238.ctl : 48 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/CTLCardinality2949721724210297131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10743345990378183238.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,58905,2.17491,46436,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,2.23458,46436,1,0,6,74203,7,1,2515,46214,1
FORMULA TokenRing-PT-010-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:48:51] [INFO ] Invariant cache hit.
[2024-05-29 17:48:51] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-29 17:48:51] [INFO ] Invariant cache hit.
[2024-05-29 17:48:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:48:53] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:48:53] [INFO ] Invariant cache hit.
[2024-05-29 17:48:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:49:02] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2024-05-29 17:49:02] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:49:02] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 5 ms to minimize.
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 65 places in 333 ms of which 3 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 12 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:49:11] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:49:11] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:49:11] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:49:11] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:49:12] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:49:12] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:49:12] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:49:12] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:49:13] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:49:20] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 4 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:49:21] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:49:22] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:49:23] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 3 ms to minimize.
[2024-05-29 17:49:23] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:49:23] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:49:24] [INFO ] Deduced a trap composed of 64 places in 297 ms of which 2 ms to minimize.
[2024-05-29 17:49:24] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:49:24] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:49:24] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
SMT process timed out in 31356ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31379ms
Finished structural reductions in LTL mode , in 1 iterations and 33520 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:49:24] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:49:25] [INFO ] Flatten gal took : 36 ms
[2024-05-29 17:49:25] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:49:25] [INFO ] Flatten gal took : 38 ms
[2024-05-29 17:49:25] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:49:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14752283932195763574.gal : 56 ms
[2024-05-29 17:49:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16119938858614114207.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/CTLCardinality14752283932195763574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16119938858614114207.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,58905,2.09268,46432,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: AG(AX(((A((State_0_9==1) U ((State_9_3==0)||(State_4_0==1))) + (State_4_3==0)) + ((State_2_3==1)||((State_10_0==0)&&(State_7_8==1))))))
=> equivalent forward existential formula: ([(FwdU(((EY(FwdU(Init,TRUE)) * !(((State_2_3==1)||((State_10_0==0)&&(State_7_8==1))))) * !((State_4_3==0))),!((...414
Hit Full ! (commute/partial/dont) 1051/60/60
Hit Full ! (commute/partial/dont) 1051/60/60
(forward)formula 0,0,9.02463,180104,1,0,74,479129,34,9,8388,260256,70
FORMULA TokenRing-PT-010-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 11 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:49:34] [INFO ] Invariant cache hit.
[2024-05-29 17:49:34] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-29 17:49:34] [INFO ] Invariant cache hit.
[2024-05-29 17:49:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:49:36] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:49:36] [INFO ] Invariant cache hit.
[2024-05-29 17:49:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:49:43] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 2 ms to minimize.
[2024-05-29 17:49:43] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:49:44] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:49:45] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2024-05-29 17:49:45] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-29 17:49:45] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:49:45] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:49:46] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2024-05-29 17:49:47] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:49:47] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 2 ms to minimize.
[2024-05-29 17:49:47] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 3 ms to minimize.
[2024-05-29 17:49:47] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:49:48] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 1 ms to minimize.
[2024-05-29 17:49:48] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 1 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:49:49] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:49:50] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 3 ms to minimize.
[2024-05-29 17:49:51] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:49:52] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:49:52] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:49:52] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:49:52] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:49:53] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:49:53] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:50:01] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 4 ms to minimize.
[2024-05-29 17:50:01] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:50:02] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:50:02] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:50:02] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:02] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:50:03] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 3 ms to minimize.
[2024-05-29 17:50:03] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:50:03] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-05-29 17:50:03] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:50:04] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:50:04] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:50:04] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:50:04] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:50:05] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:50:06] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:50:06] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:50:06] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30034 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 2 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:50:10] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:50:11] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:50:11] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:50:11] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 4 ms to minimize.
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:50:12] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:50:13] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:50:13] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:50:13] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:50:13] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:50:14] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:50:14] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:50:14] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:50:14] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:50:15] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:50:17] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 2 ms to minimize.
[2024-05-29 17:50:18] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:50:19] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:50:19] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:50:19] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:50:19] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:50:22] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:50:24] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 2 ms to minimize.
[2024-05-29 17:50:24] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 3 ms to minimize.
[2024-05-29 17:50:24] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:50:24] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:50:25] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 3 ms to minimize.
[2024-05-29 17:50:25] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:50:25] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:50:25] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:50:26] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:26] [INFO ] Deduced a trap composed of 69 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:50:26] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:50:27] [INFO ] Deduced a trap composed of 68 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:50:27] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:50:27] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:50:27] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:50:28] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:50:28] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:50:28] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:29] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:50:29] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:50:31] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:50:32] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
[2024-05-29 17:50:32] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:50:32] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:50:32] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:50:33] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:50:33] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:50:33] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:50:34] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:50:34] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:50:34] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:50:34] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:50:35] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:50:36] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:50:36] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:50:36] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:50:36] [INFO ] Deduced a trap composed of 62 places in 258 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30038 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 61152ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61172ms
Finished structural reductions in LTL mode , in 1 iterations and 63073 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:50:37] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:50:37] [INFO ] Flatten gal took : 40 ms
[2024-05-29 17:50:37] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:50:37] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:50:37] [INFO ] Flatten gal took : 38 ms
[2024-05-29 17:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14556990641010173849.gal : 7 ms
[2024-05-29 17:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13784863388642608048.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/CTLCardinality14556990641010173849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13784863388642608048.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,58905,1.71205,46432,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: E(E(A((((State_1_1==1)&&(State_6_6==0))&&(((State_10_1==0)||(State_6_6==1))&&((State_8_5==0)||(State_1_0==1)))) U !(AF((State_0_8==1)))) ...208
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(!((E(!(!(!(EG(!((State_0_8==1)))))) U (!((((State_1_1==1)&&(State_6_6==0))&&(((State_10_1==0)|...347
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
Detected timeout of ITS tools.
[2024-05-29 17:51:07] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:51:07] [INFO ] Applying decomposition
[2024-05-29 17:51:07] [INFO ] Flatten gal took : 25 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/graph8336440361338274691.txt' '-o' '/tmp/graph8336440361338274691.bin' '-w' '/tmp/graph8336440361338274691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8336440361338274691.bin' '-l' '-1' '-v' '-w' '/tmp/graph8336440361338274691.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:51:07] [INFO ] Decomposing Gal with order
[2024-05-29 17:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:51:08] [INFO ] Removed a total of 2376 redundant transitions.
[2024-05-29 17:51:08] [INFO ] Flatten gal took : 65 ms
[2024-05-29 17:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 63 ms.
[2024-05-29 17:51:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12909058638643294272.gal : 18 ms
[2024-05-29 17:51:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality10133939703200611549.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/CTLCardinality12909058638643294272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10133939703200611549.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,58905,1.38285,35964,1246,14,57911,176,1582,55554,17,497,0
Converting to forward existential form...Done !
original formula: E(E(A((((i4.i1.u44.State_1_1==1)&&(i2.i2.u8.State_6_6==0))&&(((i2.i9.u41.State_10_1==0)||(i2.i2.u8.State_6_6==1))&&((i2.i1.u5.State_8_5==...295
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(!((E(!(!(!(EG(!((i1.i1.u42.State_0_8==1)))))) U (!((((i4.i1.u44.State_1_1==1)&&(i2.i2.u8.State...454
Reverse transition relation is NOT exact ! Due to transitions t29, t49, t51, t56, t91, t95, t97, t109, t121, t126, t144, t151, t167, t179, t190, t201, t214...2901
(forward)formula 0,0,7.93529,198324,1,0,371347,185,8514,669097,67,942,1131165
FORMULA TokenRing-PT-010-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:51:16] [INFO ] Invariant cache hit.
[2024-05-29 17:51:16] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-29 17:51:16] [INFO ] Invariant cache hit.
[2024-05-29 17:51:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:51:18] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:51:18] [INFO ] Invariant cache hit.
[2024-05-29 17:51:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2024-05-29 17:51:25] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 1 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 2 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:51:26] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:51:27] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:51:28] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:51:29] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:51:30] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:51:31] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:51:32] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:51:33] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:51:33] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:51:33] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:51:34] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:51:34] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:51:34] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:51:34] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:51:35] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:51:35] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:51:35] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:51:35] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:51:36] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 2 ms to minimize.
[2024-05-29 17:51:36] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 3 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:51:44] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:51:45] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:51:45] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 3 ms to minimize.
[2024-05-29 17:51:45] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:51:46] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 3 ms to minimize.
[2024-05-29 17:51:46] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:51:46] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:51:46] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 1 ms to minimize.
[2024-05-29 17:51:46] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:51:47] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:51:47] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:51:47] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:51:47] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:51:48] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30033 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:51:53] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:51:53] [INFO ] Deduced a trap composed of 63 places in 311 ms of which 2 ms to minimize.
[2024-05-29 17:51:53] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 1 ms to minimize.
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 1 ms to minimize.
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 1 ms to minimize.
[2024-05-29 17:51:54] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 1 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 1 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:51:55] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 3 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:51:56] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:51:57] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:52:00] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 2 ms to minimize.
[2024-05-29 17:52:00] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:52:00] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:52:00] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:52:01] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:52:01] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:52:01] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:52:01] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:52:02] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 3 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:52:03] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:52:04] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:52:05] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:52:07] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 2 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 3 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:52:11] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:52:12] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:52:13] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:52:15] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:52:16] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:52:16] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 3 ms to minimize.
[2024-05-29 17:52:16] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:52:16] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 2 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 1 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 3 ms to minimize.
[2024-05-29 17:52:17] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:52:18] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:52:18] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:52:18] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:52:18] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
SMT process timed out in 61512ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61533ms
Finished structural reductions in LTL mode , in 1 iterations and 63486 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:52:19] [INFO ] Flatten gal took : 36 ms
[2024-05-29 17:52:19] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:52:19] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:52:19] [INFO ] Flatten gal took : 42 ms
[2024-05-29 17:52:20] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:52:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16062403891236384316.gal : 13 ms
[2024-05-29 17:52:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality903218642560893066.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/CTLCardinality16062403891236384316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality903218642560893066.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,58905,1.97979,46436,2,3551,5,74203,6,0,1598,46214,0
Converting to forward existential form...Done !
original formula: (A(E(EX(((AX(((State_6_9==0)||(State_1_6==1))) + (State_4_10==0)) + ((State_2_4==1)||(State_8_5==1)))) U ((EX((State_4_6==0)) * (State_6_...419
=> equivalent forward existential formula: ([((Init * !(EG(!((!(((State_4_7!=1)||(!((State_8_5==0)||(State_8_4==1))))) + !((E(!(!(EG(!((State_0_5==1))))) U...988
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t17, t20, t24, t26, t29, t31, t34, t41, t46, t49, t51, t55, t56, t58, t66, t72, t77,...2206
(forward)formula 0,1,27.7214,579288,1,0,1366,2.10161e+06,1480,454,12507,1.5882e+06,1953
FORMULA TokenRing-PT-010-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 17:52:48] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:52:48] [INFO ] Flatten gal took : 37 ms
Total runtime 603328 ms.
BK_STOP 1717005168246
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="TokenRing-PT-010"
export BK_EXAMINATION="CTLCardinality"
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 TokenRing-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r422-smll-171690573700161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;