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.r356-tall-171683762000866.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 ShieldRVs-PT-100A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000866
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 652K 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 ShieldRVs-PT-100A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717068127066

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 11:22:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 11:22:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:22:08] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-30 11:22:08] [INFO ] Transformed 1403 places.
[2024-05-30 11:22:08] [INFO ] Transformed 1903 transitions.
[2024-05-30 11:22:08] [INFO ] Found NUPN structural information;
[2024-05-30 11:22:08] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 281 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 116 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:22:08] [INFO ] Computed 401 invariants in 38 ms
[2024-05-30 11:22:09] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-30 11:22:09] [INFO ] Invariant cache hit.
[2024-05-30 11:22:11] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:22:11] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30079 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61269ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61309ms
Finished structural reductions in LTL mode , in 1 iterations and 63937 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Support contains 281 out of 1403 places after structural reductions.
[2024-05-30 11:23:13] [INFO ] Flatten gal took : 315 ms
[2024-05-30 11:23:13] [INFO ] Flatten gal took : 198 ms
[2024-05-30 11:23:13] [INFO ] Input system was already deterministic with 1903 transitions.
Support contains 276 out of 1403 places (down from 281) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 97 to 96
RANDOM walk for 40000 steps (28 resets) in 2407 ms. (16 steps per ms) remains 11/96 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 346 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 9/9 properties
[2024-05-30 11:23:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 138/187 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 138/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1216/1403 variables, 352/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1216/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1903/3306 variables, 1403/3207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3306/3306 variables, and 3207 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1749 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 138/187 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 138/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1216/1403 variables, 352/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1216/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-30 11:23:18] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 32 ms to minimize.
[2024-05-30 11:23:18] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 4 ms to minimize.
[2024-05-30 11:23:18] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:23:18] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 11:23:18] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 4 ms to minimize.
[2024-05-30 11:23:19] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:23:19] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:23:19] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:23:19] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:23:19] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:23:20] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 2 ms to minimize.
[2024-05-30 11:23:20] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:23:20] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:23:20] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-05-30 11:23:21] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 5 ms to minimize.
[2024-05-30 11:23:21] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:23:21] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 2 ms to minimize.
[2024-05-30 11:23:21] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:23:21] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:23:22] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 20/1824 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-30 11:23:22] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-30 11:23:22] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 6837ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 192 times.
Drop transitions (Partial Free agglomeration) removed 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 194 place count 1402 transition count 1902
Applied a total of 194 rules in 450 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 1166 ms. (34 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:23:23] [INFO ] Computed 401 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 90/121 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1402 variables, 370/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1281/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:24] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:23:24] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 3 ms to minimize.
[2024-05-30 11:23:25] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-05-30 11:23:25] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 2 ms to minimize.
[2024-05-30 11:23:25] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:23:25] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 11:23:25] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 2 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 2 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 11:23:26] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 3 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 11:23:27] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-30 11:23:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 12/1835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:29] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:23:30] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 2/3239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 0/3239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/3304 variables, 0/3239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6835 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 90/121 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1402 variables, 370/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1281/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 34/1837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:31] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 3 ms to minimize.
[2024-05-30 11:23:31] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 3 ms to minimize.
[2024-05-30 11:23:31] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 3 ms to minimize.
[2024-05-30 11:23:31] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-05-30 11:23:32] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 3 ms to minimize.
[2024-05-30 11:23:32] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 3 ms to minimize.
[2024-05-30 11:23:32] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:23:32] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 4 ms to minimize.
[2024-05-30 11:23:33] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:23:33] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 2 ms to minimize.
[2024-05-30 11:23:33] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:23:33] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 11:23:33] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:23:34] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1857 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-30 11:23:35] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:23:36] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:23:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:23:37] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:23:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 11:23:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 11:23:37] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 20/1877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 5/3284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:38] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 4 ms to minimize.
[2024-05-30 11:23:39] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 4 ms to minimize.
[2024-05-30 11:23:39] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 4 ms to minimize.
[2024-05-30 11:23:39] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 4 ms to minimize.
[2024-05-30 11:23:40] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 4 ms to minimize.
[2024-05-30 11:23:40] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 5 ms to minimize.
[2024-05-30 11:23:41] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 4 ms to minimize.
[2024-05-30 11:23:41] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 4 ms to minimize.
[2024-05-30 11:23:41] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 4 ms to minimize.
[2024-05-30 11:23:42] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 4 ms to minimize.
[2024-05-30 11:23:42] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 5 ms to minimize.
[2024-05-30 11:23:42] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 4 ms to minimize.
[2024-05-30 11:23:43] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2024-05-30 11:23:43] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 5 ms to minimize.
[2024-05-30 11:23:44] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 4 ms to minimize.
[2024-05-30 11:23:44] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 4 ms to minimize.
[2024-05-30 11:23:45] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 5 ms to minimize.
[2024-05-30 11:23:45] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 4 ms to minimize.
[2024-05-30 11:23:45] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 5 ms to minimize.
[2024-05-30 11:23:46] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:47] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 4 ms to minimize.
[2024-05-30 11:23:47] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 4 ms to minimize.
[2024-05-30 11:23:47] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 5 ms to minimize.
[2024-05-30 11:23:48] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 4 ms to minimize.
[2024-05-30 11:23:48] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 4 ms to minimize.
[2024-05-30 11:23:49] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 6 ms to minimize.
[2024-05-30 11:23:49] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 3 ms to minimize.
[2024-05-30 11:23:49] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 4 ms to minimize.
[2024-05-30 11:23:50] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 4 ms to minimize.
[2024-05-30 11:23:50] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 4 ms to minimize.
[2024-05-30 11:23:50] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 3 ms to minimize.
[2024-05-30 11:23:51] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 4 ms to minimize.
[2024-05-30 11:23:51] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-05-30 11:23:51] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-05-30 11:23:52] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 3 ms to minimize.
[2024-05-30 11:23:52] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 3 ms to minimize.
[2024-05-30 11:23:52] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 4 ms to minimize.
[2024-05-30 11:23:53] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 3 ms to minimize.
[2024-05-30 11:23:53] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 4 ms to minimize.
[2024-05-30 11:23:53] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:23:54] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 3 ms to minimize.
[2024-05-30 11:23:54] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 4 ms to minimize.
[2024-05-30 11:23:55] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 3 ms to minimize.
[2024-05-30 11:23:55] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 3 ms to minimize.
[2024-05-30 11:23:56] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 3 ms to minimize.
[2024-05-30 11:23:56] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 5 ms to minimize.
[2024-05-30 11:23:56] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 3 ms to minimize.
[2024-05-30 11:23:57] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 3 ms to minimize.
[2024-05-30 11:23:57] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 3 ms to minimize.
[2024-05-30 11:23:57] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 3 ms to minimize.
[2024-05-30 11:23:57] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 4 ms to minimize.
[2024-05-30 11:23:58] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 3 ms to minimize.
[2024-05-30 11:23:58] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 4 ms to minimize.
[2024-05-30 11:23:58] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 3 ms to minimize.
[2024-05-30 11:23:59] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 4 ms to minimize.
[2024-05-30 11:23:59] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 3 ms to minimize.
[2024-05-30 11:23:59] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2024-05-30 11:24:00] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 3 ms to minimize.
[2024-05-30 11:24:00] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 4 ms to minimize.
[2024-05-30 11:24:00] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:01] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 4 ms to minimize.
[2024-05-30 11:24:02] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 3 ms to minimize.
[2024-05-30 11:24:02] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 4 ms to minimize.
[2024-05-30 11:24:02] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 3 ms to minimize.
[2024-05-30 11:24:03] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 4 ms to minimize.
[2024-05-30 11:24:03] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 3 ms to minimize.
[2024-05-30 11:24:03] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 3 ms to minimize.
[2024-05-30 11:24:03] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 5 ms to minimize.
[2024-05-30 11:24:04] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2024-05-30 11:24:04] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 3 ms to minimize.
[2024-05-30 11:24:04] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
[2024-05-30 11:24:05] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 3 ms to minimize.
[2024-05-30 11:24:05] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:24:05] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 3 ms to minimize.
[2024-05-30 11:24:06] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 4 ms to minimize.
[2024-05-30 11:24:06] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 4 ms to minimize.
[2024-05-30 11:24:06] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
[2024-05-30 11:24:06] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 2 ms to minimize.
[2024-05-30 11:24:07] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-05-30 11:24:07] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 20/3364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:08] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 4 ms to minimize.
[2024-05-30 11:24:08] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-05-30 11:24:08] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 3 ms to minimize.
[2024-05-30 11:24:09] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 4 ms to minimize.
[2024-05-30 11:24:09] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-05-30 11:24:09] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-30 11:24:10] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 3 ms to minimize.
[2024-05-30 11:24:10] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-05-30 11:24:10] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-05-30 11:24:11] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 3 ms to minimize.
[2024-05-30 11:24:11] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 4 ms to minimize.
[2024-05-30 11:24:11] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:24:12] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 3 ms to minimize.
[2024-05-30 11:24:12] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:24:12] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-05-30 11:24:12] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2024-05-30 11:24:13] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-30 11:24:13] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:24:13] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2024-05-30 11:24:14] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 20/3384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:14] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 3 ms to minimize.
[2024-05-30 11:24:15] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:24:15] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:24:15] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2024-05-30 11:24:15] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
SMT process timed out in 51992ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15539 ms.
Support contains 31 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1402 transition count 1902
Applied a total of 6 rules in 142 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 92761 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 92761 steps, saw 51584 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:24:35] [INFO ] Computed 401 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 90/121 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1402 variables, 370/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1281/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:35] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 3 ms to minimize.
[2024-05-30 11:24:35] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 3 ms to minimize.
[2024-05-30 11:24:36] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:24:36] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:24:36] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:24:36] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 11:24:37] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 11:24:38] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:24:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-30 11:24:40] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 12/1835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:41] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 4 ms to minimize.
[2024-05-30 11:24:41] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:24:41] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 4 ms to minimize.
[2024-05-30 11:24:41] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 3 ms to minimize.
[2024-05-30 11:24:42] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 3 ms to minimize.
[2024-05-30 11:24:42] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:24:42] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-05-30 11:24:42] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:24:43] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2024-05-30 11:24:43] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:24:43] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 11/3248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 0/3248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/3304 variables, 0/3248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3248 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9140 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 90/121 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1402 variables, 370/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1281/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 43/1846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:44] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 3 ms to minimize.
[2024-05-30 11:24:45] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 3 ms to minimize.
[2024-05-30 11:24:45] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:24:45] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-05-30 11:24:45] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 4 ms to minimize.
[2024-05-30 11:24:45] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:24:46] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 11:24:46] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:24:46] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:24:46] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:24:46] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 5 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 11:24:47] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:24:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:24:49] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 11:24:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:24:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 12/1878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 5/3285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:50] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 3 ms to minimize.
[2024-05-30 11:24:51] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 3 ms to minimize.
[2024-05-30 11:24:51] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 4 ms to minimize.
[2024-05-30 11:24:51] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 3 ms to minimize.
[2024-05-30 11:24:52] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 3 ms to minimize.
[2024-05-30 11:24:52] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 4 ms to minimize.
[2024-05-30 11:24:53] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 4 ms to minimize.
[2024-05-30 11:24:53] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 4 ms to minimize.
[2024-05-30 11:24:53] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 4 ms to minimize.
[2024-05-30 11:24:54] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 4 ms to minimize.
[2024-05-30 11:24:54] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 4 ms to minimize.
[2024-05-30 11:24:54] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 4 ms to minimize.
[2024-05-30 11:24:55] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 3 ms to minimize.
[2024-05-30 11:24:55] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 4 ms to minimize.
[2024-05-30 11:24:56] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 4 ms to minimize.
[2024-05-30 11:24:56] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 4 ms to minimize.
[2024-05-30 11:24:56] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 4 ms to minimize.
[2024-05-30 11:24:57] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 4 ms to minimize.
[2024-05-30 11:24:57] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 4 ms to minimize.
[2024-05-30 11:24:57] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:24:58] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:24:59] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 3 ms to minimize.
[2024-05-30 11:24:59] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 3 ms to minimize.
[2024-05-30 11:24:59] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:25:00] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:25:00] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:25:00] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:25:00] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 3 ms to minimize.
[2024-05-30 11:25:01] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-05-30 11:25:01] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 4 ms to minimize.
[2024-05-30 11:25:01] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2024-05-30 11:25:02] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 3 ms to minimize.
[2024-05-30 11:25:02] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-05-30 11:25:02] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:25:02] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:25:03] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-05-30 11:25:03] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-05-30 11:25:03] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:25:04] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-05-30 11:25:04] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:05] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 4 ms to minimize.
[2024-05-30 11:25:05] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:25:05] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2024-05-30 11:25:06] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:25:06] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 4 ms to minimize.
[2024-05-30 11:25:06] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-05-30 11:25:07] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2024-05-30 11:25:07] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 3 ms to minimize.
[2024-05-30 11:25:07] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-05-30 11:25:07] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2024-05-30 11:25:08] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-05-30 11:25:08] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2024-05-30 11:25:08] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2024-05-30 11:25:09] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 3 ms to minimize.
[2024-05-30 11:25:09] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:25:09] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:25:09] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2024-05-30 11:25:10] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-05-30 11:25:10] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 2 ms to minimize.
[2024-05-30 11:25:10] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:11] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2024-05-30 11:25:11] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 3 ms to minimize.
[2024-05-30 11:25:12] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 3 ms to minimize.
[2024-05-30 11:25:12] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
[2024-05-30 11:25:12] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2024-05-30 11:25:12] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-05-30 11:25:13] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2024-05-30 11:25:13] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-05-30 11:25:13] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 3 ms to minimize.
[2024-05-30 11:25:14] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-05-30 11:25:14] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-30 11:25:14] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:25:14] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:25:15] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-30 11:25:15] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:25:15] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-30 11:25:15] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-30 11:25:15] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:25:16] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:25:16] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 20/3365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:17] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:25:17] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:25:17] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:25:17] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-30 11:25:17] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:25:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-30 11:25:19] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:19] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:25:19] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-30 11:25:19] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:20] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:20] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:20] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:20] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 20/3385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:21] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:21] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 11:25:21] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:21] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:21] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:25:22] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:23] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:24] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:24] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 20/3405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-05-30 11:25:25] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-05-30 11:25:26] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:25:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:25:28] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 20/3425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:25:29] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:25:30] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:31] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3304 variables, 20/3445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:32] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:25:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:25:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:25:33] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:33] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3304 variables, 5/3450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3304 variables, 0/3450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-30 11:25:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/3304 variables, 2/3452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:35] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:25:35] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:25:36] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:37] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3304 variables, 20/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:38] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:39] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:39] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:39] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:39] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:40] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:25:41] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:25:42] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3304 variables, 20/3492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:42] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:25:43] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:43] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:43] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:43] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3304 variables, 5/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3304 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:45] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:25:45] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2024-05-30 11:25:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:25:45] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:25:45] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:25:46] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:47] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2024-05-30 11:25:48] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:25:48] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/3304 variables, 20/3517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:48] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:25:48] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:49] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:25:49] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 5 ms to minimize.
[2024-05-30 11:25:49] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:25:49] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/3304 variables, 6/3523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:50] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/3304 variables, 1/3524 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:25:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/3304 variables, 1/3525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3304 variables, 0/3525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 0/3304 variables, 0/3525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3525 constraints, problems are : Problem set: 0 solved, 5 unsolved in 69714 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 315/315 constraints]
After SMT, in 78889ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 19024 ms.
Support contains 25 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 55 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1402/1402 places, 1902/1902 transitions.
[2024-05-30 11:26:13] [INFO ] Flatten gal took : 98 ms
[2024-05-30 11:26:13] [INFO ] Flatten gal took : 104 ms
[2024-05-30 11:26:13] [INFO ] Input system was already deterministic with 1903 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:26:13] [INFO ] Computed 401 invariants in 9 ms
[2024-05-30 11:26:14] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-30 11:26:14] [INFO ] Invariant cache hit.
[2024-05-30 11:26:15] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:26:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30045 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61012ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61032ms
Finished structural reductions in LTL mode , in 1 iterations and 63405 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:27:17] [INFO ] Flatten gal took : 88 ms
[2024-05-30 11:27:17] [INFO ] Flatten gal took : 91 ms
[2024-05-30 11:27:17] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:27:17] [INFO ] Flatten gal took : 95 ms
[2024-05-30 11:27:17] [INFO ] Flatten gal took : 79 ms
[2024-05-30 11:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16164172852925476751.gal : 51 ms
[2024-05-30 11:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8470906068359086985.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16164172852925476751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8470906068359086985.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.
Detected timeout of ITS tools.
[2024-05-30 11:27:47] [INFO ] Flatten gal took : 128 ms
[2024-05-30 11:27:47] [INFO ] Applying decomposition
[2024-05-30 11:27:47] [INFO ] Flatten gal took : 122 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/graph4944103298136157986.txt' '-o' '/tmp/graph4944103298136157986.bin' '-w' '/tmp/graph4944103298136157986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4944103298136157986.bin' '-l' '-1' '-v' '-w' '/tmp/graph4944103298136157986.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:27:48] [INFO ] Decomposing Gal with order
[2024-05-30 11:27:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:27:48] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:27:48] [INFO ] Flatten gal took : 339 ms
[2024-05-30 11:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2344 labels/synchronizations in 272 ms.
[2024-05-30 11:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8299519113440227967.gal : 25 ms
[2024-05-30 11:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability922432679262504384.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/CTLFireability8299519113440227967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability922432679262504384.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 143 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:28:19] [INFO ] Computed 401 invariants in 7 ms
[2024-05-30 11:28:20] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-30 11:28:20] [INFO ] Invariant cache hit.
[2024-05-30 11:28:22] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2678 ms to find 0 implicit places.
[2024-05-30 11:28:23] [INFO ] Redundant transitions in 829 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-05-30 11:28:23] [INFO ] Computed 401 invariants in 5 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30045 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30035 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 61121ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 62 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64847 ms. Remains : 1402/1403 places, 1901/1903 transitions.
[2024-05-30 11:29:24] [INFO ] Flatten gal took : 129 ms
[2024-05-30 11:29:24] [INFO ] Flatten gal took : 104 ms
[2024-05-30 11:29:24] [INFO ] Input system was already deterministic with 1901 transitions.
[2024-05-30 11:29:24] [INFO ] Flatten gal took : 91 ms
RANDOM walk for 8209 steps (3 resets) in 182 ms. (44 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-100A-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 11:29:24] [INFO ] Flatten gal took : 75 ms
[2024-05-30 11:29:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13242007456594474950.gal : 10 ms
[2024-05-30 11:29:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5979180064759488436.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13242007456594474950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5979180064759488436.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 126 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-05-30 11:29:25] [INFO ] Computed 401 invariants in 5 ms
[2024-05-30 11:29:25] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-30 11:29:25] [INFO ] Invariant cache hit.
[2024-05-30 11:29:27] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2024-05-30 11:29:28] [INFO ] Redundant transitions in 488 ms returned [599]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-05-30 11:29:28] [INFO ] Computed 401 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30746ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 61 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 33894 ms. Remains : 1401/1403 places, 1900/1903 transitions.
[2024-05-30 11:29:58] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:29:59] [INFO ] Flatten gal took : 60 ms
[2024-05-30 11:29:59] [INFO ] Input system was already deterministic with 1900 transitions.
RANDOM walk for 4017 steps (0 resets) in 50 ms. (78 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-100A-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 11:29:59] [INFO ] Flatten gal took : 83 ms
[2024-05-30 11:29:59] [INFO ] Flatten gal took : 58 ms
[2024-05-30 11:29:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9684809519503458020.gal : 9 ms
[2024-05-30 11:29:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5696268071968391757.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9684809519503458020.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5696268071968391757.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 42 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:29:59] [INFO ] Computed 401 invariants in 6 ms
[2024-05-30 11:30:00] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-30 11:30:00] [INFO ] Invariant cache hit.
[2024-05-30 11:30:01] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:30:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30036 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61075ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61109ms
Finished structural reductions in LTL mode , in 1 iterations and 63568 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:31:03] [INFO ] Flatten gal took : 69 ms
[2024-05-30 11:31:03] [INFO ] Flatten gal took : 73 ms
[2024-05-30 11:31:03] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:31:03] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:31:03] [INFO ] Flatten gal took : 105 ms
[2024-05-30 11:31:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1463313464349210130.gal : 16 ms
[2024-05-30 11:31:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3431826634317998913.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1463313464349210130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3431826634317998913.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.
Detected timeout of ITS tools.
[2024-05-30 11:31:33] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:31:33] [INFO ] Applying decomposition
[2024-05-30 11:31:33] [INFO ] Flatten gal took : 71 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/graph12719906861189249170.txt' '-o' '/tmp/graph12719906861189249170.bin' '-w' '/tmp/graph12719906861189249170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12719906861189249170.bin' '-l' '-1' '-v' '-w' '/tmp/graph12719906861189249170.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:31:33] [INFO ] Decomposing Gal with order
[2024-05-30 11:31:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:31:34] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:31:34] [INFO ] Flatten gal took : 96 ms
[2024-05-30 11:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2328 labels/synchronizations in 90 ms.
[2024-05-30 11:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9448566979829730043.gal : 16 ms
[2024-05-30 11:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13446601556689884651.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/CTLFireability9448566979829730043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13446601556689884651.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:32:04] [INFO ] Invariant cache hit.
[2024-05-30 11:32:04] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-30 11:32:04] [INFO ] Invariant cache hit.
[2024-05-30 11:32:06] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:32:06] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30030 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in LTL mode , in 1 iterations and 63217 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:33:07] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:33:07] [INFO ] Flatten gal took : 74 ms
[2024-05-30 11:33:07] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:33:07] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:33:07] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:33:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7579333003372543251.gal : 9 ms
[2024-05-30 11:33:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8133910990763514092.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7579333003372543251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8133910990763514092.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.
Detected timeout of ITS tools.
[2024-05-30 11:33:38] [INFO ] Flatten gal took : 73 ms
[2024-05-30 11:33:38] [INFO ] Applying decomposition
[2024-05-30 11:33:38] [INFO ] Flatten gal took : 71 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/graph8794256814356599940.txt' '-o' '/tmp/graph8794256814356599940.bin' '-w' '/tmp/graph8794256814356599940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8794256814356599940.bin' '-l' '-1' '-v' '-w' '/tmp/graph8794256814356599940.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:33:38] [INFO ] Decomposing Gal with order
[2024-05-30 11:33:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:33:38] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:33:38] [INFO ] Flatten gal took : 131 ms
[2024-05-30 11:33:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2096 labels/synchronizations in 89 ms.
[2024-05-30 11:33:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7681923510251196409.gal : 14 ms
[2024-05-30 11:33:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13004806316404230033.ctl : 15 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/CTLFireability7681923510251196409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13004806316404230033.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 37 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:34:08] [INFO ] Invariant cache hit.
[2024-05-30 11:34:09] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-30 11:34:09] [INFO ] Invariant cache hit.
[2024-05-30 11:34:11] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2317 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30038 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61024ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61043ms
Finished structural reductions in LTL mode , in 1 iterations and 63402 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:35:12] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:35:12] [INFO ] Flatten gal took : 73 ms
[2024-05-30 11:35:12] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:35:12] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:35:12] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:35:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12682491782249066999.gal : 9 ms
[2024-05-30 11:35:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9776932471643089474.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12682491782249066999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9776932471643089474.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.
Detected timeout of ITS tools.
[2024-05-30 11:35:42] [INFO ] Flatten gal took : 76 ms
[2024-05-30 11:35:42] [INFO ] Applying decomposition
[2024-05-30 11:35:42] [INFO ] Flatten gal took : 79 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/graph8884573621536352326.txt' '-o' '/tmp/graph8884573621536352326.bin' '-w' '/tmp/graph8884573621536352326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8884573621536352326.bin' '-l' '-1' '-v' '-w' '/tmp/graph8884573621536352326.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:35:43] [INFO ] Decomposing Gal with order
[2024-05-30 11:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:35:43] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:35:43] [INFO ] Flatten gal took : 100 ms
[2024-05-30 11:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2304 labels/synchronizations in 99 ms.
[2024-05-30 11:35:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15132767141200989903.gal : 18 ms
[2024-05-30 11:35:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4750482412713730948.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/CTLFireability15132767141200989903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4750482412713730948.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 41 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:36:13] [INFO ] Invariant cache hit.
[2024-05-30 11:36:14] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-30 11:36:14] [INFO ] Invariant cache hit.
[2024-05-30 11:36:15] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:36:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30039 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30027 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61004ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61021ms
Finished structural reductions in LTL mode , in 1 iterations and 63389 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:37:16] [INFO ] Flatten gal took : 66 ms
[2024-05-30 11:37:16] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:37:17] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:37:17] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:37:17] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:37:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10573064141282852580.gal : 8 ms
[2024-05-30 11:37:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18149275709656762184.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10573064141282852580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18149275709656762184.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.
Detected timeout of ITS tools.
[2024-05-30 11:37:47] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:37:47] [INFO ] Applying decomposition
[2024-05-30 11:37:47] [INFO ] Flatten gal took : 70 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/graph304197851379959532.txt' '-o' '/tmp/graph304197851379959532.bin' '-w' '/tmp/graph304197851379959532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph304197851379959532.bin' '-l' '-1' '-v' '-w' '/tmp/graph304197851379959532.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:37:47] [INFO ] Decomposing Gal with order
[2024-05-30 11:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:37:47] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:37:47] [INFO ] Flatten gal took : 95 ms
[2024-05-30 11:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2080 labels/synchronizations in 129 ms.
[2024-05-30 11:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15356693936128480125.gal : 21 ms
[2024-05-30 11:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12802456828608490957.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15356693936128480125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12802456828608490957.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:38:18] [INFO ] Invariant cache hit.
[2024-05-30 11:38:18] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-30 11:38:18] [INFO ] Invariant cache hit.
[2024-05-30 11:38:20] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61001ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61018ms
Finished structural reductions in LTL mode , in 1 iterations and 63375 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:39:21] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:39:21] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:39:21] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:39:21] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:39:21] [INFO ] Flatten gal took : 74 ms
[2024-05-30 11:39:21] [INFO ] Time to serialize gal into /tmp/CTLFireability103746775921297676.gal : 10 ms
[2024-05-30 11:39:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12140006815803254128.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/CTLFireability103746775921297676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12140006815803254128.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.
Detected timeout of ITS tools.
[2024-05-30 11:39:52] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:39:52] [INFO ] Applying decomposition
[2024-05-30 11:39:52] [INFO ] Flatten gal took : 74 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/graph5298347400813578386.txt' '-o' '/tmp/graph5298347400813578386.bin' '-w' '/tmp/graph5298347400813578386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5298347400813578386.bin' '-l' '-1' '-v' '-w' '/tmp/graph5298347400813578386.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:39:52] [INFO ] Decomposing Gal with order
[2024-05-30 11:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:39:52] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:39:52] [INFO ] Flatten gal took : 82 ms
[2024-05-30 11:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2184 labels/synchronizations in 140 ms.
[2024-05-30 11:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8599986499856215034.gal : 22 ms
[2024-05-30 11:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability18250023844027328280.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8599986499856215034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18250023844027328280.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 40 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:40:22] [INFO ] Invariant cache hit.
[2024-05-30 11:40:23] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-30 11:40:23] [INFO ] Invariant cache hit.
[2024-05-30 11:40:25] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:40:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30041 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30025 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61053ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61070ms
Finished structural reductions in LTL mode , in 1 iterations and 63542 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:41:26] [INFO ] Flatten gal took : 66 ms
[2024-05-30 11:41:26] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:41:26] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:41:26] [INFO ] Flatten gal took : 69 ms
[2024-05-30 11:41:26] [INFO ] Flatten gal took : 78 ms
[2024-05-30 11:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3252273235112885298.gal : 8 ms
[2024-05-30 11:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1165003718974328674.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3252273235112885298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1165003718974328674.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.
Detected timeout of ITS tools.
[2024-05-30 11:41:56] [INFO ] Flatten gal took : 76 ms
[2024-05-30 11:41:56] [INFO ] Applying decomposition
[2024-05-30 11:41:56] [INFO ] Flatten gal took : 69 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/graph1080588090690383700.txt' '-o' '/tmp/graph1080588090690383700.bin' '-w' '/tmp/graph1080588090690383700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1080588090690383700.bin' '-l' '-1' '-v' '-w' '/tmp/graph1080588090690383700.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:41:57] [INFO ] Decomposing Gal with order
[2024-05-30 11:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:41:57] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:41:57] [INFO ] Flatten gal took : 80 ms
[2024-05-30 11:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2264 labels/synchronizations in 79 ms.
[2024-05-30 11:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2779115297652896647.gal : 12 ms
[2024-05-30 11:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10601236444208551077.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/CTLFireability2779115297652896647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10601236444208551077.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 103 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:42:27] [INFO ] Computed 401 invariants in 4 ms
[2024-05-30 11:42:28] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-30 11:42:28] [INFO ] Invariant cache hit.
[2024-05-30 11:42:29] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
[2024-05-30 11:42:30] [INFO ] Redundant transitions in 329 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-05-30 11:42:30] [INFO ] Computed 401 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30038 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30030 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 61026ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 61043ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 51 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63901 ms. Remains : 1402/1403 places, 1901/1903 transitions.
[2024-05-30 11:43:31] [INFO ] Flatten gal took : 76 ms
[2024-05-30 11:43:31] [INFO ] Flatten gal took : 69 ms
[2024-05-30 11:43:31] [INFO ] Input system was already deterministic with 1901 transitions.
[2024-05-30 11:43:31] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:43:31] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:43:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13522596382206655443.gal : 9 ms
[2024-05-30 11:43:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7991995311231116804.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13522596382206655443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7991995311231116804.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.
Detected timeout of ITS tools.
[2024-05-30 11:44:01] [INFO ] Flatten gal took : 69 ms
[2024-05-30 11:44:01] [INFO ] Applying decomposition
[2024-05-30 11:44:01] [INFO ] Flatten gal took : 69 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/graph879890888641154638.txt' '-o' '/tmp/graph879890888641154638.bin' '-w' '/tmp/graph879890888641154638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph879890888641154638.bin' '-l' '-1' '-v' '-w' '/tmp/graph879890888641154638.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:44:02] [INFO ] Decomposing Gal with order
[2024-05-30 11:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:44:02] [INFO ] Removed a total of 2095 redundant transitions.
[2024-05-30 11:44:02] [INFO ] Flatten gal took : 79 ms
[2024-05-30 11:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2332 labels/synchronizations in 81 ms.
[2024-05-30 11:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14994440964605718445.gal : 12 ms
[2024-05-30 11:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7399563297003383053.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14994440964605718445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7399563297003383053.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:44:32] [INFO ] Computed 401 invariants in 7 ms
[2024-05-30 11:44:33] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-30 11:44:33] [INFO ] Invariant cache hit.
[2024-05-30 11:44:34] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30047 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61140ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61164ms
Finished structural reductions in LTL mode , in 1 iterations and 63603 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:45:36] [INFO ] Flatten gal took : 67 ms
[2024-05-30 11:45:36] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:45:36] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:45:36] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:45:36] [INFO ] Flatten gal took : 69 ms
[2024-05-30 11:45:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5856178638719747672.gal : 9 ms
[2024-05-30 11:45:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17882762908320946957.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5856178638719747672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17882762908320946957.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.
Detected timeout of ITS tools.
[2024-05-30 11:46:06] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:46:06] [INFO ] Applying decomposition
[2024-05-30 11:46:06] [INFO ] Flatten gal took : 71 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/graph9391217762389376867.txt' '-o' '/tmp/graph9391217762389376867.bin' '-w' '/tmp/graph9391217762389376867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9391217762389376867.bin' '-l' '-1' '-v' '-w' '/tmp/graph9391217762389376867.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:46:06] [INFO ] Decomposing Gal with order
[2024-05-30 11:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:46:07] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:46:07] [INFO ] Flatten gal took : 80 ms
[2024-05-30 11:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2264 labels/synchronizations in 80 ms.
[2024-05-30 11:46:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11026183782685759881.gal : 12 ms
[2024-05-30 11:46:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11142001072189344084.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11026183782685759881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11142001072189344084.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 32 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:46:37] [INFO ] Invariant cache hit.
[2024-05-30 11:46:37] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-30 11:46:37] [INFO ] Invariant cache hit.
[2024-05-30 11:46:39] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:46:39] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30035 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61030ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61064ms
Finished structural reductions in LTL mode , in 1 iterations and 63441 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:47:40] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:47:40] [INFO ] Flatten gal took : 78 ms
[2024-05-30 11:47:40] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:47:41] [INFO ] Flatten gal took : 74 ms
[2024-05-30 11:47:41] [INFO ] Flatten gal took : 76 ms
[2024-05-30 11:47:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8876244229009473946.gal : 9 ms
[2024-05-30 11:47:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14252193295754082918.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8876244229009473946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14252193295754082918.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.
Detected timeout of ITS tools.
[2024-05-30 11:48:11] [INFO ] Flatten gal took : 94 ms
[2024-05-30 11:48:11] [INFO ] Applying decomposition
[2024-05-30 11:48:11] [INFO ] Flatten gal took : 69 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/graph6551251216874371696.txt' '-o' '/tmp/graph6551251216874371696.bin' '-w' '/tmp/graph6551251216874371696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6551251216874371696.bin' '-l' '-1' '-v' '-w' '/tmp/graph6551251216874371696.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:48:11] [INFO ] Decomposing Gal with order
[2024-05-30 11:48:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:48:11] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:48:11] [INFO ] Flatten gal took : 86 ms
[2024-05-30 11:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2136 labels/synchronizations in 78 ms.
[2024-05-30 11:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12112488669637474058.gal : 11 ms
[2024-05-30 11:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4399564539705354406.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/CTLFireability12112488669637474058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4399564539705354406.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:48:41] [INFO ] Invariant cache hit.
[2024-05-30 11:48:42] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-30 11:48:42] [INFO ] Invariant cache hit.
[2024-05-30 11:48:44] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:48:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30032 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60966ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60984ms
Finished structural reductions in LTL mode , in 1 iterations and 63363 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:49:45] [INFO ] Flatten gal took : 67 ms
[2024-05-30 11:49:45] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:49:45] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:49:45] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:49:45] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:49:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9897821727874957049.gal : 10 ms
[2024-05-30 11:49:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3005154710685768922.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9897821727874957049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3005154710685768922.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.
Detected timeout of ITS tools.
[2024-05-30 11:50:15] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:50:15] [INFO ] Applying decomposition
[2024-05-30 11:50:15] [INFO ] Flatten gal took : 73 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/graph17417799369287763844.txt' '-o' '/tmp/graph17417799369287763844.bin' '-w' '/tmp/graph17417799369287763844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17417799369287763844.bin' '-l' '-1' '-v' '-w' '/tmp/graph17417799369287763844.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:50:15] [INFO ] Decomposing Gal with order
[2024-05-30 11:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:50:16] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:50:16] [INFO ] Flatten gal took : 82 ms
[2024-05-30 11:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2280 labels/synchronizations in 80 ms.
[2024-05-30 11:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9868989495964237232.gal : 12 ms
[2024-05-30 11:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2334831965527580387.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9868989495964237232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2334831965527580387.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 40 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:50:46] [INFO ] Invariant cache hit.
[2024-05-30 11:50:47] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-30 11:50:47] [INFO ] Invariant cache hit.
[2024-05-30 11:50:48] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:50:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30026 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
(s953 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61068ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61085ms
Finished structural reductions in LTL mode , in 1 iterations and 63479 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:51:49] [INFO ] Flatten gal took : 67 ms
[2024-05-30 11:51:49] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:51:50] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:51:50] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:51:50] [INFO ] Flatten gal took : 68 ms
[2024-05-30 11:51:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12234063324851222489.gal : 9 ms
[2024-05-30 11:51:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7925675197263794105.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/CTLFireability12234063324851222489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7925675197263794105.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.
Detected timeout of ITS tools.
[2024-05-30 11:52:20] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:52:20] [INFO ] Applying decomposition
[2024-05-30 11:52:20] [INFO ] Flatten gal took : 68 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/graph5813970060159628822.txt' '-o' '/tmp/graph5813970060159628822.bin' '-w' '/tmp/graph5813970060159628822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5813970060159628822.bin' '-l' '-1' '-v' '-w' '/tmp/graph5813970060159628822.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:52:20] [INFO ] Decomposing Gal with order
[2024-05-30 11:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:52:20] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:52:20] [INFO ] Flatten gal took : 77 ms
[2024-05-30 11:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2240 labels/synchronizations in 77 ms.
[2024-05-30 11:52:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12909316519415335714.gal : 11 ms
[2024-05-30 11:52:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12831429896956915127.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12909316519415335714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12831429896956915127.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 34 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-05-30 11:52:50] [INFO ] Invariant cache hit.
[2024-05-30 11:52:51] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-30 11:52:51] [INFO ] Invariant cache hit.
[2024-05-30 11:52:53] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-05-30 11:52:53] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30042 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60877ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in LTL mode , in 1 iterations and 63221 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2024-05-30 11:53:54] [INFO ] Flatten gal took : 74 ms
[2024-05-30 11:53:54] [INFO ] Flatten gal took : 79 ms
[2024-05-30 11:53:54] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 11:53:54] [INFO ] Flatten gal took : 78 ms
[2024-05-30 11:53:54] [INFO ] Flatten gal took : 74 ms
[2024-05-30 11:53:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15818368392562146992.gal : 9 ms
[2024-05-30 11:53:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16640946317685704099.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15818368392562146992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16640946317685704099.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.
Detected timeout of ITS tools.
[2024-05-30 11:54:24] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:54:24] [INFO ] Applying decomposition
[2024-05-30 11:54:24] [INFO ] Flatten gal took : 70 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/graph13122039482198595619.txt' '-o' '/tmp/graph13122039482198595619.bin' '-w' '/tmp/graph13122039482198595619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13122039482198595619.bin' '-l' '-1' '-v' '-w' '/tmp/graph13122039482198595619.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:54:24] [INFO ] Decomposing Gal with order
[2024-05-30 11:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:54:25] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:54:25] [INFO ] Flatten gal took : 90 ms
[2024-05-30 11:54:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2136 labels/synchronizations in 81 ms.
[2024-05-30 11:54:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1487940276509606928.gal : 12 ms
[2024-05-30 11:54:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13401411562699166843.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/CTLFireability1487940276509606928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13401411562699166843.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 102 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:54:55] [INFO ] Computed 401 invariants in 6 ms
[2024-05-30 11:54:56] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-30 11:54:56] [INFO ] Invariant cache hit.
[2024-05-30 11:54:57] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-30 11:54:58] [INFO ] Redundant transitions in 309 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-05-30 11:54:58] [INFO ] Computed 401 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30028 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60952ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 46 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63855 ms. Remains : 1402/1403 places, 1901/1903 transitions.
[2024-05-30 11:55:59] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:55:59] [INFO ] Flatten gal took : 72 ms
[2024-05-30 11:55:59] [INFO ] Input system was already deterministic with 1901 transitions.
[2024-05-30 11:55:59] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:55:59] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16434123248189150653.gal : 9 ms
[2024-05-30 11:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4958664749613057599.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16434123248189150653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4958664749613057599.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.
Detected timeout of ITS tools.
[2024-05-30 11:56:29] [INFO ] Flatten gal took : 78 ms
[2024-05-30 11:56:29] [INFO ] Applying decomposition
[2024-05-30 11:56:29] [INFO ] Flatten gal took : 79 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/graph11702845082089317574.txt' '-o' '/tmp/graph11702845082089317574.bin' '-w' '/tmp/graph11702845082089317574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11702845082089317574.bin' '-l' '-1' '-v' '-w' '/tmp/graph11702845082089317574.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:56:30] [INFO ] Decomposing Gal with order
[2024-05-30 11:56:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:56:30] [INFO ] Removed a total of 2095 redundant transitions.
[2024-05-30 11:56:30] [INFO ] Flatten gal took : 91 ms
[2024-05-30 11:56:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2052 labels/synchronizations in 87 ms.
[2024-05-30 11:56:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15546203468144656399.gal : 15 ms
[2024-05-30 11:56:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2169471903867393365.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15546203468144656399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2169471903867393365.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.
Detected timeout of ITS tools.
[2024-05-30 11:57:00] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:57:00] [INFO ] Flatten gal took : 71 ms
[2024-05-30 11:57:00] [INFO ] Applying decomposition
[2024-05-30 11:57:00] [INFO ] Flatten gal took : 72 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/graph2500944332204088606.txt' '-o' '/tmp/graph2500944332204088606.bin' '-w' '/tmp/graph2500944332204088606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2500944332204088606.bin' '-l' '-1' '-v' '-w' '/tmp/graph2500944332204088606.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:57:00] [INFO ] Decomposing Gal with order
[2024-05-30 11:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:57:00] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:57:00] [INFO ] Flatten gal took : 81 ms
[2024-05-30 11:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2216 labels/synchronizations in 79 ms.
[2024-05-30 11:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1281917265111393105.gal : 12 ms
[2024-05-30 11:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13175651182377836323.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/CTLFireability1281917265111393105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13175651182377836323.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-30 12:05:33] [INFO ] Applying decomposition
[2024-05-30 12:05:33] [INFO ] Flatten gal took : 73 ms
[2024-05-30 12:05:33] [INFO ] Decomposing Gal with order
[2024-05-30 12:05:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:05:34] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 12:05:34] [INFO ] Flatten gal took : 86 ms
[2024-05-30 12:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 44 ms.
[2024-05-30 12:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6535358571255607566.gal : 11 ms
[2024-05-30 12:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10795372457868648088.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6535358571255607566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10795372457868648088.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.06274e+198,130.92,3342856,43977,28,5.84084e+06,1543,2525,1.47327e+07,29,1330,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-30 12:11:40] [INFO ] Flatten gal took : 79 ms
[2024-05-30 12:11:40] [INFO ] Input system was already deterministic with 1903 transitions.
[2024-05-30 12:11:40] [INFO ] Transformed 1403 places.
[2024-05-30 12:11:40] [INFO ] Transformed 1903 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 12:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8506313193028750555.gal : 11 ms
[2024-05-30 12:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6455445426740234320.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8506313193028750555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6455445426740234320.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-100A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762000866"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;