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.r378-smll-171683810800138.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 SieveSingleMsgMbox-PT-d2m96, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716952403337

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 03:13:25] [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-29 03:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:13:26] [INFO ] Load time of PNML (sax parser for PT used): 562 ms
[2024-05-29 03:13:26] [INFO ] Transformed 2398 places.
[2024-05-29 03:13:26] [INFO ] Transformed 1954 transitions.
[2024-05-29 03:13:26] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 893 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 121 ms.
Deduced a syphon composed of 1984 places in 21 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 60 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 931 place count 311 transition count 946
Iterating global reduction 1 with 78 rules applied. Total rules applied 1009 place count 311 transition count 946
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1023 place count 311 transition count 932
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1068 place count 266 transition count 887
Iterating global reduction 2 with 45 rules applied. Total rules applied 1113 place count 266 transition count 887
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 1140 place count 266 transition count 860
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1163 place count 243 transition count 834
Iterating global reduction 3 with 23 rules applied. Total rules applied 1186 place count 243 transition count 834
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 3 with 74 rules applied. Total rules applied 1260 place count 243 transition count 760
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1265 place count 238 transition count 749
Iterating global reduction 4 with 5 rules applied. Total rules applied 1270 place count 238 transition count 749
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1273 place count 235 transition count 746
Iterating global reduction 4 with 3 rules applied. Total rules applied 1276 place count 235 transition count 746
Applied a total of 1276 rules in 287 ms. Remains 235 /414 variables (removed 179) and now considering 746/1954 (removed 1208) transitions.
// Phase 1: matrix 746 rows 235 cols
[2024-05-29 03:13:27] [INFO ] Computed 5 invariants in 96 ms
[2024-05-29 03:13:28] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-29 03:13:28] [INFO ] Invariant cache hit.
[2024-05-29 03:13:28] [INFO ] State equation strengthened by 569 read => feed constraints.
[2024-05-29 03:13:30] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 3432 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2024-05-29 03:13:30] [INFO ] Invariant cache hit.
[2024-05-29 03:13:30] [INFO ] State equation strengthened by 569 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 1/235 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-29 03:13:55] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 25 ms to minimize.
[2024-05-29 03:13:55] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 6 (OVERLAPS) 746/981 variables, 235/242 constraints. Problems are: Problem set: 0 solved, 745 unsolved
SMT process timed out in 32969ms, After SMT, problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 33021ms
Starting structural reductions in LTL mode, iteration 1 : 235/414 places, 746/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36822 ms. Remains : 235/414 places, 746/1954 transitions.
Support contains 60 out of 235 places after structural reductions.
[2024-05-29 03:14:04] [INFO ] Flatten gal took : 136 ms
[2024-05-29 03:14:04] [INFO ] Flatten gal took : 79 ms
[2024-05-29 03:14:04] [INFO ] Input system was already deterministic with 746 transitions.
Support contains 57 out of 235 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 54 to 52
RANDOM walk for 40000 steps (9005 resets) in 4122 ms. (9 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (183 resets) in 61 ms. (64 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (178 resets) in 100 ms. (39 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (195 resets) in 96 ms. (41 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (201 resets) in 105 ms. (37 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (397 resets) in 66 ms. (59 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (199 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (206 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (183 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (192 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (176 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (176 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (179 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (172 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (190 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (188 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (173 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (183 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (178 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (195 resets) in 67 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (167 resets) in 43 ms. (91 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (183 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (197 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (167 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (416 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (428 resets) in 62 ms. (63 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (185 resets) in 67 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (199 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (198 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (168 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (190 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (191 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (426 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (204 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (197 resets) in 57 ms. (69 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (190 resets) in 70 ms. (56 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (183 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (199 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (199 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (186 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (180 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (170 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (411 resets) in 79 ms. (50 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (180 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (185 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (165 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (195 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (429 resets) in 64 ms. (61 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (182 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (205 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (201 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
Interrupted probabilistic random walk after 327116 steps, run timeout after 6001 ms. (steps per millisecond=54 ) properties seen :26 out of 52
Probabilistic random walk after 327116 steps, saw 159229 distinct states, run finished after 6007 ms. (steps per millisecond=54 ) properties seen :26
[2024-05-29 03:14:12] [INFO ] Invariant cache hit.
[2024-05-29 03:14:12] [INFO ] State equation strengthened by 569 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 85/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 16/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 62/201 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 590/791 variables, 201/206 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 413/619 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 10 (OVERLAPS) 190/981 variables, 34/653 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 156/809 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/809 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/981 variables, 0/809 constraints. Problems are: Problem set: 3 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 809 constraints, problems are : Problem set: 3 solved, 23 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 235/235 constraints, ReadFeed: 569/569 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 87/121 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 16/137 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 62/199 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 560/759 variables, 199/204 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 383/587 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/759 variables, 1/588 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/759 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 222/981 variables, 36/624 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 186/810 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 22/832 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-29 03:14:21] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 3 ms to minimize.
[2024-05-29 03:14:21] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 2 ms to minimize.
[2024-05-29 03:14:21] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 835 constraints, problems are : Problem set: 3 solved, 23 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 235/235 constraints, ReadFeed: 569/569 constraints, PredecessorRefiner: 23/26 constraints, Known Traps: 3/3 constraints]
After SMT, in 9266ms problems are : Problem set: 3 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 746/746 transitions.
Graph (complete) has 1102 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 234 transition count 744
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 216 transition count 570
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 216 transition count 570
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 199 transition count 552
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 199 transition count 552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 199 transition count 550
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 192 transition count 543
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 192 transition count 543
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 112 place count 192 transition count 520
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 189 transition count 515
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 189 transition count 515
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 187 transition count 513
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 187 transition count 513
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 186 transition count 512
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 186 transition count 512
Applied a total of 124 rules in 137 ms. Remains 186 /235 variables (removed 49) and now considering 512/746 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 186/235 places, 512/746 transitions.
RANDOM walk for 40000 steps (9019 resets) in 881 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (204 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (186 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (196 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (170 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (212 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (195 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (179 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (195 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (179 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (429 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (207 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (181 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (222 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (429 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (202 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (196 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (194 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (201 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (168 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (214 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (208 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (186 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (202 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 213200 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :8 out of 23
Probabilistic random walk after 213200 steps, saw 100714 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :8
// Phase 1: matrix 512 rows 186 cols
[2024-05-29 03:14:25] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 03:14:25] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 72/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 10/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 410/529 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 265/388 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 169/698 variables, 67/455 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 102/557 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/698 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 557 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 186/186 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 72/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 10/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 410/529 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 265/388 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 169/698 variables, 67/455 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 102/557 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 15/572 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 03:14:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-29 03:14:30] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/698 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 574 constraints, problems are : Problem set: 0 solved, 15 unsolved in 7143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 186/186 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 9738ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 41965 ms.
Support contains 23 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 512/512 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 179 transition count 427
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 179 transition count 427
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 173 transition count 421
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 173 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 173 transition count 417
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 172 transition count 415
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 172 transition count 415
Applied a total of 32 rules in 70 ms. Remains 172 /186 variables (removed 14) and now considering 415/512 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 172/186 places, 415/512 transitions.
RANDOM walk for 40000 steps (8964 resets) in 398 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (185 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (186 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (171 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (182 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (403 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (183 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (200 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (206 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (440 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (186 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (192 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (200 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (165 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (195 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (191 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 191736 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :1 out of 15
Probabilistic random walk after 191736 steps, saw 90219 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :1
// Phase 1: matrix 415 rows 172 cols
[2024-05-29 03:15:20] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 03:15:21] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 71/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 10/117 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 383/500 variables, 117/121 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 251/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 87/587 variables, 55/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 32/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/587 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 459 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 172/172 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 71/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 10/117 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 383/500 variables, 117/121 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 251/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 87/587 variables, 55/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 32/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 14/473 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 03:15:25] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-29 03:15:25] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-29 03:15:25] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/587 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 476 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 172/172 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 7374ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 39710 ms.
Support contains 22 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 415/415 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 171 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 170 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 170 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 169 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 169 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 169 transition count 397
Applied a total of 7 rules in 39 ms. Remains 169 /172 variables (removed 3) and now considering 397/415 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 169/172 places, 397/415 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-29 03:16:08] [INFO ] Flatten gal took : 48 ms
[2024-05-29 03:16:08] [INFO ] Flatten gal took : 52 ms
[2024-05-29 03:16:08] [INFO ] Input system was already deterministic with 746 transitions.
Computed a total of 50 stabilizing places and 97 stable transitions
Graph (complete) has 1188 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 193 transition count 292
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 193 transition count 292
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 125 place count 152 transition count 250
Iterating global reduction 0 with 41 rules applied. Total rules applied 166 place count 152 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 178 place count 152 transition count 238
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 196 place count 134 transition count 210
Iterating global reduction 1 with 18 rules applied. Total rules applied 214 place count 134 transition count 210
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 227 place count 134 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 130 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 130 transition count 192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 127 transition count 189
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 127 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 243 place count 125 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 125 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 247 place count 123 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 123 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 122 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 122 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 252 place count 121 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 121 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 120 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 120 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 119 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 119 transition count 179
Applied a total of 257 rules in 27 ms. Remains 119 /235 variables (removed 116) and now considering 179/746 (removed 567) transitions.
// Phase 1: matrix 179 rows 119 cols
[2024-05-29 03:16:08] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 03:16:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 03:16:08] [INFO ] Invariant cache hit.
[2024-05-29 03:16:08] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-29 03:16:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-29 03:16:09] [INFO ] Invariant cache hit.
[2024-05-29 03:16:09] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-29 03:16:12] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-29 03:16:12] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/298 variables, 119/126 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 220 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/298 variables, 119/126 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 178/398 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/399 constraints. Problems are: Problem set: 3 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/399 constraints. Problems are: Problem set: 3 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/298 variables, 0/399 constraints. Problems are: Problem set: 3 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 399 constraints, problems are : Problem set: 3 solved, 175 unsolved in 21298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 3/3 constraints]
After SMT, in 33356ms problems are : Problem set: 3 solved, 175 unsolved
Search for dead transitions found 3 dead transitions in 33359ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/235 places, 176/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 176
Applied a total of 3 rules in 3 ms. Remains 116 /119 variables (removed 3) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 116 cols
[2024-05-29 03:16:42] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:16:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 03:16:42] [INFO ] Invariant cache hit.
[2024-05-29 03:16:42] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-29 03:16:42] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/235 places, 176/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34523 ms. Remains : 116/235 places, 176/746 transitions.
[2024-05-29 03:16:42] [INFO ] Flatten gal took : 21 ms
[2024-05-29 03:16:42] [INFO ] Flatten gal took : 32 ms
[2024-05-29 03:16:42] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-29 03:16:43] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:16:43] [INFO ] Flatten gal took : 14 ms
[2024-05-29 03:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14858664464802666968.gal : 34 ms
[2024-05-29 03:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14415327503682787202.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/CTLFireability14858664464802666968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14415327503682787202.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-29 03:17:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:17:13] [INFO ] Applying decomposition
[2024-05-29 03:17:13] [INFO ] Flatten gal took : 8 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/graph18365764618089096663.txt' '-o' '/tmp/graph18365764618089096663.bin' '-w' '/tmp/graph18365764618089096663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18365764618089096663.bin' '-l' '-1' '-v' '-w' '/tmp/graph18365764618089096663.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:17:13] [INFO ] Decomposing Gal with order
[2024-05-29 03:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:17:13] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-29 03:17:13] [INFO ] Flatten gal took : 121 ms
[2024-05-29 03:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 38 ms.
[2024-05-29 03:17:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12844335786357269044.gal : 7 ms
[2024-05-29 03:17:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8450057665594335500.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/CTLFireability12844335786357269044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8450057665594335500.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 : 235/235 places, 746/746 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 351
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 351
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 116 place count 158 transition count 312
Iterating global reduction 0 with 38 rules applied. Total rules applied 154 place count 158 transition count 312
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 175 place count 158 transition count 291
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 189 place count 144 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 203 place count 144 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 217 place count 144 transition count 257
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 221 place count 140 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 140 transition count 252
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 137 transition count 249
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 137 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 135 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 135 transition count 247
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 133 transition count 245
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 133 transition count 245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 132 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 132 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 131 transition count 241
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 131 transition count 241
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 130 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 130 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 246 place count 129 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 129 transition count 239
Applied a total of 247 rules in 36 ms. Remains 129 /235 variables (removed 106) and now considering 239/746 (removed 507) transitions.
// Phase 1: matrix 239 rows 129 cols
[2024-05-29 03:17:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:17:43] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-29 03:17:43] [INFO ] Invariant cache hit.
[2024-05-29 03:17:43] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-29 03:17:44] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-29 03:17:44] [INFO ] Invariant cache hit.
[2024-05-29 03:17:44] [INFO ] State equation strengthened by 145 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 03:17:48] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 5 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/368 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 145/281 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 281 constraints, problems are : Problem set: 0 solved, 238 unsolved in 20506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 129/129 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/368 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 145/281 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 238/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 03:18:13] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 1/520 constraints. Problems are: Problem set: 3 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/520 constraints. Problems are: Problem set: 3 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 520 constraints, problems are : Problem set: 3 solved, 235 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 129/129 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 3/3 constraints]
After SMT, in 50871ms problems are : Problem set: 3 solved, 235 unsolved
Search for dead transitions found 3 dead transitions in 50875ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/235 places, 236/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 236
Applied a total of 3 rules in 14 ms. Remains 126 /129 variables (removed 3) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 126 cols
[2024-05-29 03:18:35] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:18:35] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-29 03:18:35] [INFO ] Invariant cache hit.
[2024-05-29 03:18:35] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-29 03:18:36] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/235 places, 236/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52954 ms. Remains : 126/235 places, 236/746 transitions.
[2024-05-29 03:18:36] [INFO ] Flatten gal took : 16 ms
[2024-05-29 03:18:36] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:18:36] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-29 03:18:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:18:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4843606426687806053.gal : 4 ms
[2024-05-29 03:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18301187374358460817.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/CTLFireability4843606426687806053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18301187374358460817.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-29 03:19:06] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:19:06] [INFO ] Applying decomposition
[2024-05-29 03:19:06] [INFO ] Flatten gal took : 10 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/graph6113364967039926431.txt' '-o' '/tmp/graph6113364967039926431.bin' '-w' '/tmp/graph6113364967039926431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6113364967039926431.bin' '-l' '-1' '-v' '-w' '/tmp/graph6113364967039926431.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:19:06] [INFO ] Decomposing Gal with order
[2024-05-29 03:19:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:19:06] [INFO ] Removed a total of 148 redundant transitions.
[2024-05-29 03:19:06] [INFO ] Flatten gal took : 25 ms
[2024-05-29 03:19:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 10 ms.
[2024-05-29 03:19:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5275043767022204405.gal : 6 ms
[2024-05-29 03:19:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11077813117308905306.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/CTLFireability5275043767022204405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11077813117308905306.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 : 235/235 places, 746/746 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 195 transition count 310
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 195 transition count 310
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 119 place count 156 transition count 270
Iterating global reduction 0 with 39 rules applied. Total rules applied 158 place count 156 transition count 270
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 177 place count 156 transition count 251
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 193 place count 140 transition count 226
Iterating global reduction 1 with 16 rules applied. Total rules applied 209 place count 140 transition count 226
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 221 place count 140 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 225 place count 136 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 229 place count 136 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 232 place count 133 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 235 place count 133 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 130 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 130 transition count 203
Applied a total of 241 rules in 16 ms. Remains 130 /235 variables (removed 105) and now considering 203/746 (removed 543) transitions.
// Phase 1: matrix 203 rows 130 cols
[2024-05-29 03:19:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:19:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 03:19:37] [INFO ] Invariant cache hit.
[2024-05-29 03:19:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-29 03:19:37] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-29 03:19:37] [INFO ] Invariant cache hit.
[2024-05-29 03:19:37] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 03:19:41] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 3 ms to minimize.
[2024-05-29 03:19:41] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/333 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 110/247 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 03:19:48] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-05-29 03:19:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/333 variables, 2/249 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 11 (OVERLAPS) 0/333 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 249 constraints, problems are : Problem set: 3 solved, 199 unsolved in 18976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 4/130 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 203/333 variables, 130/139 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 110/249 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 199/448 constraints. Problems are: Problem set: 3 solved, 199 unsolved
[2024-05-29 03:20:04] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 1/449 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/449 constraints. Problems are: Problem set: 3 solved, 199 unsolved
At refinement iteration 11 (OVERLAPS) 0/333 variables, 0/449 constraints. Problems are: Problem set: 3 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 449 constraints, problems are : Problem set: 3 solved, 199 unsolved in 28322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 199/202 constraints, Known Traps: 5/5 constraints]
After SMT, in 47582ms problems are : Problem set: 3 solved, 199 unsolved
Search for dead transitions found 3 dead transitions in 47586ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/235 places, 200/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 200
Applied a total of 3 rules in 2 ms. Remains 127 /130 variables (removed 3) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 127 cols
[2024-05-29 03:20:25] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:20:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-29 03:20:25] [INFO ] Invariant cache hit.
[2024-05-29 03:20:25] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-29 03:20:25] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 127/235 places, 200/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48861 ms. Remains : 127/235 places, 200/746 transitions.
[2024-05-29 03:20:25] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:20:25] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:20:25] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-29 03:20:25] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:20:25] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7466009611271615349.gal : 4 ms
[2024-05-29 03:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17619863490149682598.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/CTLFireability7466009611271615349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17619863490149682598.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-29 03:20:56] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:20:56] [INFO ] Applying decomposition
[2024-05-29 03:20:56] [INFO ] Flatten gal took : 9 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/graph11047416819372297162.txt' '-o' '/tmp/graph11047416819372297162.bin' '-w' '/tmp/graph11047416819372297162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11047416819372297162.bin' '-l' '-1' '-v' '-w' '/tmp/graph11047416819372297162.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:20:56] [INFO ] Decomposing Gal with order
[2024-05-29 03:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:20:56] [INFO ] Removed a total of 158 redundant transitions.
[2024-05-29 03:20:56] [INFO ] Flatten gal took : 21 ms
[2024-05-29 03:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 9 ms.
[2024-05-29 03:20:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1860442235242357810.gal : 5 ms
[2024-05-29 03:20:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13924117219622108242.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/CTLFireability1860442235242357810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13924117219622108242.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 : 235/235 places, 746/746 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 192 transition count 277
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 192 transition count 277
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 127 place count 151 transition count 235
Iterating global reduction 0 with 41 rules applied. Total rules applied 168 place count 151 transition count 235
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 181 place count 151 transition count 222
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 201 place count 131 transition count 190
Iterating global reduction 1 with 20 rules applied. Total rules applied 221 place count 131 transition count 190
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 234 place count 131 transition count 177
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 239 place count 126 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 244 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 122 transition count 166
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 122 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 254 place count 120 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 120 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 118 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 118 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 117 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 117 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 116 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 265 place count 115 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 267 place count 114 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 114 transition count 156
Applied a total of 268 rules in 20 ms. Remains 114 /235 variables (removed 121) and now considering 156/746 (removed 590) transitions.
// Phase 1: matrix 156 rows 114 cols
[2024-05-29 03:21:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:21:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 03:21:26] [INFO ] Invariant cache hit.
[2024-05-29 03:21:26] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-29 03:21:26] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-29 03:21:26] [INFO ] Invariant cache hit.
[2024-05-29 03:21:26] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-29 03:21:29] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-29 03:21:29] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/270 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 77/198 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 155 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 198 constraints, problems are : Problem set: 0 solved, 155 unsolved in 10142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/270 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 77/198 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 155/353 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-29 03:21:42] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/354 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/354 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/354 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 354 constraints, problems are : Problem set: 3 solved, 152 unsolved in 18922 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 3/3 constraints]
After SMT, in 29377ms problems are : Problem set: 3 solved, 152 unsolved
Search for dead transitions found 3 dead transitions in 29381ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/235 places, 153/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 153
Applied a total of 3 rules in 2 ms. Remains 111 /114 variables (removed 3) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 111 cols
[2024-05-29 03:21:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:21:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 03:21:56] [INFO ] Invariant cache hit.
[2024-05-29 03:21:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-29 03:21:56] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/235 places, 153/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30455 ms. Remains : 111/235 places, 153/746 transitions.
[2024-05-29 03:21:56] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:21:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:21:56] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-29 03:21:56] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:21:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:21:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5554580266362163326.gal : 17 ms
[2024-05-29 03:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11351070036393161314.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/CTLFireability5554580266362163326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11351070036393161314.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-29 03:22:26] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:22:26] [INFO ] Applying decomposition
[2024-05-29 03:22:26] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4295609088296126857.txt' '-o' '/tmp/graph4295609088296126857.bin' '-w' '/tmp/graph4295609088296126857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4295609088296126857.bin' '-l' '-1' '-v' '-w' '/tmp/graph4295609088296126857.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:22:26] [INFO ] Decomposing Gal with order
[2024-05-29 03:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:22:26] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-29 03:22:26] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 5 ms.
[2024-05-29 03:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15195268392620197029.gal : 3 ms
[2024-05-29 03:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16261134848429043989.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/CTLFireability15195268392620197029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16261134848429043989.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 : 235/235 places, 746/746 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 396
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 396
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 107 place count 164 transition count 360
Iterating global reduction 0 with 35 rules applied. Total rules applied 142 place count 164 transition count 360
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 160 place count 164 transition count 342
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 173 place count 151 transition count 324
Iterating global reduction 1 with 13 rules applied. Total rules applied 186 place count 151 transition count 324
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 202 place count 151 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 206 place count 147 transition count 303
Iterating global reduction 2 with 4 rules applied. Total rules applied 210 place count 147 transition count 303
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 213 place count 144 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 216 place count 144 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 218 place count 142 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 142 transition count 298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 222 place count 140 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 140 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 225 place count 139 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 226 place count 139 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 227 place count 138 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 228 place count 138 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 229 place count 137 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 137 transition count 291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 231 place count 136 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 136 transition count 290
Applied a total of 232 rules in 47 ms. Remains 136 /235 variables (removed 99) and now considering 290/746 (removed 456) transitions.
// Phase 1: matrix 290 rows 136 cols
[2024-05-29 03:22:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:22:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-29 03:22:57] [INFO ] Invariant cache hit.
[2024-05-29 03:22:57] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-05-29 03:22:58] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-29 03:22:58] [INFO ] Invariant cache hit.
[2024-05-29 03:22:58] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 03:23:05] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-29 03:23:05] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 290/426 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 185/328 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 03:23:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD267 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/426 variables, 1/329 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 329 constraints, problems are : Problem set: 3 solved, 286 unsolved in 29455 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 290/426 variables, 136/144 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 185/329 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 286/615 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/615 constraints. Problems are: Problem set: 3 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/615 constraints. Problems are: Problem set: 3 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 615 constraints, problems are : Problem set: 3 solved, 286 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 286/289 constraints, Known Traps: 3/3 constraints]
After SMT, in 60245ms problems are : Problem set: 3 solved, 286 unsolved
Search for dead transitions found 3 dead transitions in 60251ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/235 places, 287/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 287
Applied a total of 3 rules in 2 ms. Remains 133 /136 variables (removed 3) and now considering 287/287 (removed 0) transitions.
// Phase 1: matrix 287 rows 133 cols
[2024-05-29 03:23:59] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:23:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 03:23:59] [INFO ] Invariant cache hit.
[2024-05-29 03:23:59] [INFO ] State equation strengthened by 184 read => feed constraints.
[2024-05-29 03:23:59] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/235 places, 287/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63037 ms. Remains : 133/235 places, 287/746 transitions.
[2024-05-29 03:23:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:23:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:24:00] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-29 03:24:00] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:24:00] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:24:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5778366836421012096.gal : 3 ms
[2024-05-29 03:24:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4340142180735300178.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/CTLFireability5778366836421012096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4340142180735300178.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-29 03:24:30] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:24:30] [INFO ] Applying decomposition
[2024-05-29 03:24:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1377393043599717074.txt' '-o' '/tmp/graph1377393043599717074.bin' '-w' '/tmp/graph1377393043599717074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1377393043599717074.bin' '-l' '-1' '-v' '-w' '/tmp/graph1377393043599717074.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:24:30] [INFO ] Decomposing Gal with order
[2024-05-29 03:24:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:24:30] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-29 03:24:30] [INFO ] Flatten gal took : 20 ms
[2024-05-29 03:24:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 5 ms.
[2024-05-29 03:24:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13148548996350298779.gal : 3 ms
[2024-05-29 03:24:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17462816810719026845.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/CTLFireability13148548996350298779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17462816810719026845.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 SI_CTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 190 transition count 261
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 190 transition count 261
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 134 place count 146 transition count 216
Iterating global reduction 0 with 44 rules applied. Total rules applied 178 place count 146 transition count 216
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 194 place count 146 transition count 200
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 214 place count 126 transition count 168
Iterating global reduction 1 with 20 rules applied. Total rules applied 234 place count 126 transition count 168
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 247 place count 126 transition count 155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 120 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 120 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 115 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 115 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 272 place count 112 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 275 place count 112 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 277 place count 112 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 280 place count 109 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 108 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 286 place count 107 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 288 place count 106 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 105 transition count 129
Applied a total of 291 rules in 41 ms. Remains 105 /235 variables (removed 130) and now considering 129/746 (removed 617) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-29 03:25:00] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:25:00] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 03:25:00] [INFO ] Invariant cache hit.
[2024-05-29 03:25:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 03:25:00] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-29 03:25:00] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-29 03:25:00] [INFO ] Invariant cache hit.
[2024-05-29 03:25:00] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 03:25:03] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-29 03:25:03] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 03:25:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 170 constraints, problems are : Problem set: 3 solved, 125 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/113 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/170 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 125/295 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/295 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/295 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 295 constraints, problems are : Problem set: 3 solved, 125 unsolved in 9119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 3/3 constraints]
After SMT, in 17514ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 17517ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/235 places, 126/746 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-29 03:25:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:25:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 03:25:18] [INFO ] Invariant cache hit.
[2024-05-29 03:25:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 03:25:18] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/235 places, 126/746 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 18592 ms. Remains : 102/235 places, 126/746 transitions.
[2024-05-29 03:25:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:25:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:25:18] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-29 03:25:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:25:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:25:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4659036245624286124.gal : 3 ms
[2024-05-29 03:25:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2890043845157250175.prop : 8 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/ReachabilityCardinality4659036245624286124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2890043845157250175.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9090 resets) in 112 ms. (353 steps per ms) remains 1/1 properties

BEST_FIRST walk for 40002 steps (1884 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 2836 steps, run visited all 1 properties in 16 ms. (steps per millisecond=177 )
Probabilistic random walk after 2836 steps, saw 1365 distinct states, run finished after 36 ms. (steps per millisecond=78 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Loading property file /tmp/ReachabilityCardinality2890043845157250175.prop.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 337
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 337
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 116 place count 158 transition count 298
Iterating global reduction 0 with 38 rules applied. Total rules applied 154 place count 158 transition count 298
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 167 place count 158 transition count 285
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 183 place count 142 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 199 place count 142 transition count 261
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 214 place count 142 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 218 place count 138 transition count 241
Iterating global reduction 2 with 4 rules applied. Total rules applied 222 place count 138 transition count 241
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 225 place count 135 transition count 238
Iterating global reduction 2 with 3 rules applied. Total rules applied 228 place count 135 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 133 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 133 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 234 place count 131 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 131 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 237 place count 130 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 130 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 239 place count 129 transition count 230
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 129 transition count 230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 241 place count 128 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 242 place count 128 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 127 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 127 transition count 228
Applied a total of 244 rules in 35 ms. Remains 127 /235 variables (removed 108) and now considering 228/746 (removed 518) transitions.
// Phase 1: matrix 228 rows 127 cols
[2024-05-29 03:25:19] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:25:19] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 03:25:19] [INFO ] Invariant cache hit.
[2024-05-29 03:25:19] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-29 03:25:19] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-29 03:25:19] [INFO ] Invariant cache hit.
[2024-05-29 03:25:19] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 03:25:23] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-29 03:25:23] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/355 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 137/271 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 03:25:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD208 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/355 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/355 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 272 constraints, problems are : Problem set: 3 solved, 224 unsolved in 23120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 4/127 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 228/355 variables, 127/135 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 137/272 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 224/496 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/496 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/496 constraints. Problems are: Problem set: 3 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 496 constraints, problems are : Problem set: 3 solved, 224 unsolved in 26102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 224/227 constraints, Known Traps: 3/3 constraints]
After SMT, in 49533ms problems are : Problem set: 3 solved, 224 unsolved
Search for dead transitions found 3 dead transitions in 49537ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/235 places, 225/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 225
Applied a total of 3 rules in 3 ms. Remains 124 /127 variables (removed 3) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 124 cols
[2024-05-29 03:26:09] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:26:09] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 03:26:09] [INFO ] Invariant cache hit.
[2024-05-29 03:26:10] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-29 03:26:10] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/235 places, 225/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51676 ms. Remains : 124/235 places, 225/746 transitions.
[2024-05-29 03:26:10] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:26:10] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:26:10] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-29 03:26:10] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:26:10] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13064004708883645827.gal : 3 ms
[2024-05-29 03:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17224021181603291541.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/CTLFireability13064004708883645827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17224021181603291541.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-29 03:26:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:26:40] [INFO ] Applying decomposition
[2024-05-29 03:26:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14956765389082232505.txt' '-o' '/tmp/graph14956765389082232505.bin' '-w' '/tmp/graph14956765389082232505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14956765389082232505.bin' '-l' '-1' '-v' '-w' '/tmp/graph14956765389082232505.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:26:40] [INFO ] Decomposing Gal with order
[2024-05-29 03:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:26:40] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-29 03:26:40] [INFO ] Flatten gal took : 15 ms
[2024-05-29 03:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 5 ms.
[2024-05-29 03:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability770628452966100698.gal : 3 ms
[2024-05-29 03:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3850397519993061117.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/CTLFireability770628452966100698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3850397519993061117.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 LTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 337
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 337
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 116 place count 158 transition count 299
Iterating global reduction 0 with 38 rules applied. Total rules applied 154 place count 158 transition count 299
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 172 place count 158 transition count 281
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 187 place count 143 transition count 258
Iterating global reduction 1 with 15 rules applied. Total rules applied 202 place count 143 transition count 258
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 216 place count 143 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 140 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 140 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 138 transition count 238
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 138 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 136 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 136 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 232 place count 134 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 134 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 133 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 133 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 237 place count 132 transition count 230
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 132 transition count 230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 239 place count 131 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 131 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 241 place count 130 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 242 place count 130 transition count 228
Applied a total of 242 rules in 22 ms. Remains 130 /235 variables (removed 105) and now considering 228/746 (removed 518) transitions.
// Phase 1: matrix 228 rows 130 cols
[2024-05-29 03:27:10] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 03:27:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 03:27:11] [INFO ] Invariant cache hit.
[2024-05-29 03:27:11] [INFO ] State equation strengthened by 133 read => feed constraints.
[2024-05-29 03:27:11] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-29 03:27:11] [INFO ] Invariant cache hit.
[2024-05-29 03:27:11] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 03:27:16] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 16 ms to minimize.
[2024-05-29 03:27:16] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/358 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 133/270 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 270 constraints, problems are : Problem set: 0 solved, 227 unsolved in 19792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/358 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 133/270 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 227/497 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-29 03:27:41] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/498 constraints. Problems are: Problem set: 3 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/498 constraints. Problems are: Problem set: 3 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 498 constraints, problems are : Problem set: 3 solved, 224 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints]
After SMT, in 50380ms problems are : Problem set: 3 solved, 224 unsolved
Search for dead transitions found 3 dead transitions in 50383ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/235 places, 225/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 225
Applied a total of 3 rules in 4 ms. Remains 127 /130 variables (removed 3) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 127 cols
[2024-05-29 03:28:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:28:02] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 03:28:02] [INFO ] Invariant cache hit.
[2024-05-29 03:28:02] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-29 03:28:02] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 127/235 places, 225/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51884 ms. Remains : 127/235 places, 225/746 transitions.
[2024-05-29 03:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:28:02] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-29 03:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:28:02] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:28:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1039676652032989335.gal : 2 ms
[2024-05-29 03:28:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1227601583301473340.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/CTLFireability1039676652032989335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1227601583301473340.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-29 03:28:32] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:28:32] [INFO ] Applying decomposition
[2024-05-29 03:28:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2123485991557512056.txt' '-o' '/tmp/graph2123485991557512056.bin' '-w' '/tmp/graph2123485991557512056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2123485991557512056.bin' '-l' '-1' '-v' '-w' '/tmp/graph2123485991557512056.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:28:33] [INFO ] Decomposing Gal with order
[2024-05-29 03:28:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:28:33] [INFO ] Removed a total of 123 redundant transitions.
[2024-05-29 03:28:33] [INFO ] Flatten gal took : 13 ms
[2024-05-29 03:28:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 4 ms.
[2024-05-29 03:28:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4704537356318978472.gal : 2 ms
[2024-05-29 03:28:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3365334042729809663.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/CTLFireability4704537356318978472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3365334042729809663.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 : 235/235 places, 746/746 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 194 transition count 307
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 194 transition count 307
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 122 place count 154 transition count 266
Iterating global reduction 0 with 40 rules applied. Total rules applied 162 place count 154 transition count 266
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 180 place count 154 transition count 248
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 196 place count 138 transition count 224
Iterating global reduction 1 with 16 rules applied. Total rules applied 212 place count 138 transition count 224
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 225 place count 138 transition count 211
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 135 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 135 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 133 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 132 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 132 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 131 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 131 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 130 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 130 transition count 202
Applied a total of 241 rules in 13 ms. Remains 130 /235 variables (removed 105) and now considering 202/746 (removed 544) transitions.
// Phase 1: matrix 202 rows 130 cols
[2024-05-29 03:29:03] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:29:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 03:29:03] [INFO ] Invariant cache hit.
[2024-05-29 03:29:03] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-29 03:29:03] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-29 03:29:03] [INFO ] Invariant cache hit.
[2024-05-29 03:29:03] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 03:29:07] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-29 03:29:08] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/332 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 109/246 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 246 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16494 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/332 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 109/246 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 201/447 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 03:29:27] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-29 03:29:27] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:29:28] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 3/450 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 450 constraints, problems are : Problem set: 3 solved, 198 unsolved in 26844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 5/5 constraints]
After SMT, in 43652ms problems are : Problem set: 3 solved, 198 unsolved
Search for dead transitions found 3 dead transitions in 43658ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/235 places, 199/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 199
Applied a total of 3 rules in 2 ms. Remains 127 /130 variables (removed 3) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 127 cols
[2024-05-29 03:29:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:29:47] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 03:29:47] [INFO ] Invariant cache hit.
[2024-05-29 03:29:47] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-29 03:29:47] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 127/235 places, 199/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44757 ms. Remains : 127/235 places, 199/746 transitions.
[2024-05-29 03:29:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:29:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:29:47] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-29 03:29:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:29:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:29:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12627923046072858907.gal : 1 ms
[2024-05-29 03:29:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12928341745475032335.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/CTLFireability12627923046072858907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12928341745475032335.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-29 03:30:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:30:18] [INFO ] Applying decomposition
[2024-05-29 03:30:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13072452008544151524.txt' '-o' '/tmp/graph13072452008544151524.bin' '-w' '/tmp/graph13072452008544151524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13072452008544151524.bin' '-l' '-1' '-v' '-w' '/tmp/graph13072452008544151524.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:30:18] [INFO ] Decomposing Gal with order
[2024-05-29 03:30:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:30:18] [INFO ] Removed a total of 173 redundant transitions.
[2024-05-29 03:30:18] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:30:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 4 ms.
[2024-05-29 03:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1680105285912702228.gal : 4 ms
[2024-05-29 03:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2058970385546480256.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/CTLFireability1680105285912702228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2058970385546480256.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 SI_CTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 191 transition count 276
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 191 transition count 276
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 131 place count 148 transition count 232
Iterating global reduction 0 with 43 rules applied. Total rules applied 174 place count 148 transition count 232
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 192 place count 148 transition count 214
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 211 place count 129 transition count 184
Iterating global reduction 1 with 19 rules applied. Total rules applied 230 place count 129 transition count 184
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 243 place count 129 transition count 171
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 248 place count 124 transition count 165
Iterating global reduction 2 with 5 rules applied. Total rules applied 253 place count 124 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 257 place count 120 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 261 place count 120 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 264 place count 117 transition count 158
Iterating global reduction 2 with 3 rules applied. Total rules applied 267 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 270 place count 117 transition count 155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 273 place count 114 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 276 place count 114 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 277 place count 113 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 113 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 112 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 112 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 281 place count 111 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 111 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 110 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 110 transition count 146
Applied a total of 284 rules in 46 ms. Remains 110 /235 variables (removed 125) and now considering 146/746 (removed 600) transitions.
// Phase 1: matrix 146 rows 110 cols
[2024-05-29 03:30:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:30:48] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 03:30:48] [INFO ] Invariant cache hit.
[2024-05-29 03:30:48] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-29 03:30:48] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-29 03:30:48] [INFO ] Redundant transitions in 5 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-29 03:30:48] [INFO ] Invariant cache hit.
[2024-05-29 03:30:48] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 03:30:50] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-29 03:30:50] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/256 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/188 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 03:30:54] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/256 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 189 constraints, problems are : Problem set: 3 solved, 142 unsolved in 11582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 4/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 146/256 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 142/331 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 331 constraints, problems are : Problem set: 3 solved, 142 unsolved in 11895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 142/145 constraints, Known Traps: 3/3 constraints]
After SMT, in 23642ms problems are : Problem set: 3 solved, 142 unsolved
Search for dead transitions found 3 dead transitions in 23644ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 110/235 places, 143/746 transitions.
Graph (complete) has 361 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 107 /110 variables (removed 3) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 107 cols
[2024-05-29 03:31:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:31:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 03:31:12] [INFO ] Invariant cache hit.
[2024-05-29 03:31:12] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 03:31:12] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/235 places, 143/746 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 24684 ms. Remains : 107/235 places, 143/746 transitions.
[2024-05-29 03:31:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:31:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:31:12] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-29 03:31:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:31:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:31:12] [INFO ] Time to serialize gal into /tmp/CTLFireability15305654670523050856.gal : 2 ms
[2024-05-29 03:31:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4820895386112629537.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/CTLFireability15305654670523050856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4820895386112629537.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-29 03:31:42] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:31:42] [INFO ] Applying decomposition
[2024-05-29 03:31:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7091419661262667731.txt' '-o' '/tmp/graph7091419661262667731.bin' '-w' '/tmp/graph7091419661262667731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7091419661262667731.bin' '-l' '-1' '-v' '-w' '/tmp/graph7091419661262667731.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:31:42] [INFO ] Decomposing Gal with order
[2024-05-29 03:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:31:42] [INFO ] Removed a total of 125 redundant transitions.
[2024-05-29 03:31:42] [INFO ] Flatten gal took : 13 ms
[2024-05-29 03:31:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-29 03:31:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6784505631590471425.gal : 2 ms
[2024-05-29 03:31:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5229729939312576310.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/CTLFireability6784505631590471425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5229729939312576310.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 : 235/235 places, 746/746 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 338
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 338
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 113 place count 160 transition count 300
Iterating global reduction 0 with 37 rules applied. Total rules applied 150 place count 160 transition count 300
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 168 place count 160 transition count 282
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 181 place count 147 transition count 263
Iterating global reduction 1 with 13 rules applied. Total rules applied 194 place count 147 transition count 263
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 206 place count 147 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 209 place count 144 transition count 247
Iterating global reduction 2 with 3 rules applied. Total rules applied 212 place count 144 transition count 247
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 215 place count 141 transition count 244
Iterating global reduction 2 with 3 rules applied. Total rules applied 218 place count 141 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 220 place count 139 transition count 242
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 139 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 137 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 137 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 227 place count 136 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 228 place count 136 transition count 239
Applied a total of 228 rules in 26 ms. Remains 136 /235 variables (removed 99) and now considering 239/746 (removed 507) transitions.
// Phase 1: matrix 239 rows 136 cols
[2024-05-29 03:32:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:32:13] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 03:32:13] [INFO ] Invariant cache hit.
[2024-05-29 03:32:13] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-29 03:32:13] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-29 03:32:13] [INFO ] Invariant cache hit.
[2024-05-29 03:32:13] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 03:32:19] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-29 03:32:19] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/375 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 135/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 278 constraints, problems are : Problem set: 0 solved, 238 unsolved in 23704 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/375 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 135/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 238/516 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-29 03:32:46] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/519 constraints. Problems are: Problem set: 3 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/519 constraints. Problems are: Problem set: 3 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 0/375 variables, 0/519 constraints. Problems are: Problem set: 3 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 519 constraints, problems are : Problem set: 3 solved, 235 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 5/5 constraints]
After SMT, in 54345ms problems are : Problem set: 3 solved, 235 unsolved
Search for dead transitions found 3 dead transitions in 54350ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/235 places, 236/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 236
Applied a total of 3 rules in 3 ms. Remains 133 /136 variables (removed 3) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 133 cols
[2024-05-29 03:33:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:33:08] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 03:33:08] [INFO ] Invariant cache hit.
[2024-05-29 03:33:08] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 03:33:08] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/235 places, 236/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55907 ms. Remains : 133/235 places, 236/746 transitions.
[2024-05-29 03:33:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:33:08] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:33:08] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-29 03:33:08] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:33:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:33:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13099073912283293107.gal : 2 ms
[2024-05-29 03:33:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11066908883825774373.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/CTLFireability13099073912283293107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11066908883825774373.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-29 03:33:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:33:39] [INFO ] Applying decomposition
[2024-05-29 03:33:39] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2998730074429911215.txt' '-o' '/tmp/graph2998730074429911215.bin' '-w' '/tmp/graph2998730074429911215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2998730074429911215.bin' '-l' '-1' '-v' '-w' '/tmp/graph2998730074429911215.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:33:39] [INFO ] Decomposing Gal with order
[2024-05-29 03:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:33:39] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-29 03:33:39] [INFO ] Flatten gal took : 14 ms
[2024-05-29 03:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 3 ms.
[2024-05-29 03:33:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1787035460274902477.gal : 2 ms
[2024-05-29 03:33:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5838604610452838708.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/CTLFireability1787035460274902477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5838604610452838708.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 SI_CTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 194 transition count 321
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 194 transition count 321
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 122 place count 154 transition count 280
Iterating global reduction 0 with 40 rules applied. Total rules applied 162 place count 154 transition count 280
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 179 place count 154 transition count 263
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 196 place count 137 transition count 237
Iterating global reduction 1 with 17 rules applied. Total rules applied 213 place count 137 transition count 237
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 227 place count 137 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 133 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 133 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 130 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 130 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 243 place count 128 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 128 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 247 place count 126 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 126 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 125 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 125 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 252 place count 124 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 124 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 123 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 123 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 122 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 122 transition count 205
Applied a total of 257 rules in 62 ms. Remains 122 /235 variables (removed 113) and now considering 205/746 (removed 541) transitions.
// Phase 1: matrix 205 rows 122 cols
[2024-05-29 03:34:09] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:34:09] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 03:34:09] [INFO ] Invariant cache hit.
[2024-05-29 03:34:09] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-29 03:34:10] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-05-29 03:34:10] [INFO ] Redundant transitions in 14 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-29 03:34:10] [INFO ] Invariant cache hit.
[2024-05-29 03:34:10] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-29 03:34:14] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 3 ms to minimize.
[2024-05-29 03:34:14] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/327 variables, 122/129 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 117/246 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 246 constraints, problems are : Problem set: 0 solved, 204 unsolved in 17595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/327 variables, 122/129 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 117/246 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 204/450 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-29 03:34:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD187 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 1/451 constraints. Problems are: Problem set: 3 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/451 constraints. Problems are: Problem set: 3 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/327 variables, 0/451 constraints. Problems are: Problem set: 3 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 451 constraints, problems are : Problem set: 3 solved, 201 unsolved in 24451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 3/3 constraints]
After SMT, in 42461ms problems are : Problem set: 3 solved, 201 unsolved
Search for dead transitions found 3 dead transitions in 42478ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/235 places, 202/746 transitions.
Graph (complete) has 440 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 119 /122 variables (removed 3) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 119 cols
[2024-05-29 03:34:52] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:34:52] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 03:34:52] [INFO ] Invariant cache hit.
[2024-05-29 03:34:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-29 03:34:53] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 119/235 places, 202/746 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 44297 ms. Remains : 119/235 places, 202/746 transitions.
[2024-05-29 03:34:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:34:53] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:34:53] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-29 03:34:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:34:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13467045803397335051.gal : 2 ms
[2024-05-29 03:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1103871891216149204.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/CTLFireability13467045803397335051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1103871891216149204.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-29 03:35:23] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:35:23] [INFO ] Applying decomposition
[2024-05-29 03:35:23] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16093347721275644333.txt' '-o' '/tmp/graph16093347721275644333.bin' '-w' '/tmp/graph16093347721275644333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16093347721275644333.bin' '-l' '-1' '-v' '-w' '/tmp/graph16093347721275644333.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:35:23] [INFO ] Decomposing Gal with order
[2024-05-29 03:35:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:35:23] [INFO ] Removed a total of 190 redundant transitions.
[2024-05-29 03:35:23] [INFO ] Flatten gal took : 40 ms
[2024-05-29 03:35:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 3 ms.
[2024-05-29 03:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17659765628888654808.gal : 3 ms
[2024-05-29 03:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15698752892595971605.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/CTLFireability17659765628888654808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15698752892595971605.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 SI_CTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 191 transition count 276
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 191 transition count 276
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 131 place count 148 transition count 232
Iterating global reduction 0 with 43 rules applied. Total rules applied 174 place count 148 transition count 232
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 190 place count 148 transition count 216
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 208 place count 130 transition count 188
Iterating global reduction 1 with 18 rules applied. Total rules applied 226 place count 130 transition count 188
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 238 place count 130 transition count 176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 242 place count 126 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 246 place count 126 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 249 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 252 place count 123 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 254 place count 121 transition count 166
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 121 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 119 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 119 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 118 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 118 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 117 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 117 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 265 place count 116 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 267 place count 115 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 115 transition count 158
Applied a total of 268 rules in 32 ms. Remains 115 /235 variables (removed 120) and now considering 158/746 (removed 588) transitions.
// Phase 1: matrix 158 rows 115 cols
[2024-05-29 03:35:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:35:53] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 03:35:53] [INFO ] Invariant cache hit.
[2024-05-29 03:35:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-29 03:35:54] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-29 03:35:54] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 03:35:54] [INFO ] Invariant cache hit.
[2024-05-29 03:35:54] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/273 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 77/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 199 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/273 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 77/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 157/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 03:36:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/357 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/357 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/357 constraints. Problems are: Problem set: 3 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 357 constraints, problems are : Problem set: 3 solved, 154 unsolved in 17568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 3/3 constraints]
After SMT, in 30103ms problems are : Problem set: 3 solved, 154 unsolved
Search for dead transitions found 3 dead transitions in 30105ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/235 places, 155/746 transitions.
Graph (complete) has 382 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 112 /115 variables (removed 3) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 112 cols
[2024-05-29 03:36:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:36:24] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 03:36:24] [INFO ] Invariant cache hit.
[2024-05-29 03:36:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-29 03:36:25] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 112/235 places, 155/746 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 31659 ms. Remains : 112/235 places, 155/746 transitions.
[2024-05-29 03:36:25] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:36:25] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:36:25] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-29 03:36:25] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:36:25] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:36:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17732463882816023093.gal : 2 ms
[2024-05-29 03:36:25] [INFO ] Time to serialize properties into /tmp/CTLFireability361328130747999881.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/CTLFireability17732463882816023093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability361328130747999881.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-29 03:36:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:36:55] [INFO ] Applying decomposition
[2024-05-29 03:36:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4926634558943955048.txt' '-o' '/tmp/graph4926634558943955048.bin' '-w' '/tmp/graph4926634558943955048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4926634558943955048.bin' '-l' '-1' '-v' '-w' '/tmp/graph4926634558943955048.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:36:55] [INFO ] Decomposing Gal with order
[2024-05-29 03:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:36:55] [INFO ] Removed a total of 155 redundant transitions.
[2024-05-29 03:36:55] [INFO ] Flatten gal took : 19 ms
[2024-05-29 03:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 4 ms.
[2024-05-29 03:36:55] [INFO ] Time to serialize gal into /tmp/CTLFireability263595853569238082.gal : 4 ms
[2024-05-29 03:36:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18209944129627123557.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/CTLFireability263595853569238082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18209944129627123557.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 SI_CTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 189 transition count 246
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 189 transition count 246
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 136 place count 145 transition count 201
Iterating global reduction 0 with 44 rules applied. Total rules applied 180 place count 145 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 195 place count 145 transition count 186
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 215 place count 125 transition count 154
Iterating global reduction 1 with 20 rules applied. Total rules applied 235 place count 125 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 247 place count 125 transition count 142
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 119 transition count 135
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 119 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 114 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 114 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 272 place count 111 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 275 place count 111 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 111 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 279 place count 108 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 282 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 107 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 106 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 287 place count 105 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 104 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 104 transition count 117
Applied a total of 290 rules in 50 ms. Remains 104 /235 variables (removed 131) and now considering 117/746 (removed 629) transitions.
// Phase 1: matrix 117 rows 104 cols
[2024-05-29 03:37:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:37:26] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-29 03:37:26] [INFO ] Invariant cache hit.
[2024-05-29 03:37:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 03:37:26] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-29 03:37:26] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-29 03:37:26] [INFO ] Invariant cache hit.
[2024-05-29 03:37:26] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:37:28] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-29 03:37:28] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/221 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 45/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/221 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 45/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:37:37] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/273 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/221 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 273 constraints, problems are : Problem set: 3 solved, 113 unsolved in 11130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 18224ms problems are : Problem set: 3 solved, 113 unsolved
Search for dead transitions found 3 dead transitions in 18226ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/235 places, 114/746 transitions.
Graph (complete) has 322 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 101 /104 variables (removed 3) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 101 cols
[2024-05-29 03:37:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:37:44] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 03:37:44] [INFO ] Invariant cache hit.
[2024-05-29 03:37:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 03:37:45] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 101/235 places, 114/746 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 19618 ms. Remains : 101/235 places, 114/746 transitions.
[2024-05-29 03:37:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:37:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:37:45] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:37:45] [INFO ] Flatten gal took : 27 ms
[2024-05-29 03:37:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8489343616701217331.gal : 2 ms
[2024-05-29 03:37:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14415094108635270407.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/ReachabilityCardinality8489343616701217331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14415094108635270407.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14415094108635270407.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
RANDOM walk for 40000 steps (8862 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40002 steps (4224 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1782 steps, run visited all 1 properties in 7 ms. (steps per millisecond=254 )
Probabilistic random walk after 1782 steps, saw 880 distinct states, run finished after 7 ms. (steps per millisecond=254 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 746/746 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 189 transition count 246
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 189 transition count 246
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 137 place count 144 transition count 200
Iterating global reduction 0 with 45 rules applied. Total rules applied 182 place count 144 transition count 200
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 198 place count 144 transition count 184
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 219 place count 123 transition count 150
Iterating global reduction 1 with 21 rules applied. Total rules applied 240 place count 123 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 253 place count 123 transition count 137
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 260 place count 116 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 267 place count 116 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 110 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 110 transition count 123
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 283 place count 106 transition count 119
Iterating global reduction 2 with 4 rules applied. Total rules applied 287 place count 106 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 289 place count 106 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 293 place count 102 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 102 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 298 place count 101 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 100 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 99 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 304 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 98 transition count 107
Applied a total of 305 rules in 13 ms. Remains 98 /235 variables (removed 137) and now considering 107/746 (removed 639) transitions.
// Phase 1: matrix 107 rows 98 cols
[2024-05-29 03:37:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 03:37:45] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 03:37:45] [INFO ] Invariant cache hit.
[2024-05-29 03:37:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 03:37:46] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-29 03:37:46] [INFO ] Invariant cache hit.
[2024-05-29 03:37:46] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-29 03:37:48] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-29 03:37:48] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/205 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 146 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/205 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 106/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-29 03:37:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/253 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/253 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/253 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 253 constraints, problems are : Problem set: 3 solved, 103 unsolved in 10148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 17251ms problems are : Problem set: 3 solved, 103 unsolved
Search for dead transitions found 3 dead transitions in 17254ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/235 places, 104/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 95 transition count 104
Applied a total of 3 rules in 1 ms. Remains 95 /98 variables (removed 3) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-29 03:38:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:38:03] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 03:38:03] [INFO ] Invariant cache hit.
[2024-05-29 03:38:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-29 03:38:03] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/235 places, 104/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18269 ms. Remains : 95/235 places, 104/746 transitions.
[2024-05-29 03:38:03] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:38:03] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:38:03] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-29 03:38:03] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:38:03] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:38:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15565534436113538269.gal : 2 ms
[2024-05-29 03:38:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1804325308050977367.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/CTLFireability15565534436113538269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1804325308050977367.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-29 03:38:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:38:33] [INFO ] Applying decomposition
[2024-05-29 03:38:33] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10119399804491768281.txt' '-o' '/tmp/graph10119399804491768281.bin' '-w' '/tmp/graph10119399804491768281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10119399804491768281.bin' '-l' '-1' '-v' '-w' '/tmp/graph10119399804491768281.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:38:33] [INFO ] Decomposing Gal with order
[2024-05-29 03:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:38:33] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-29 03:38:33] [INFO ] Flatten gal took : 19 ms
[2024-05-29 03:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 1 ms.
[2024-05-29 03:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4194316282285641570.gal : 16 ms
[2024-05-29 03:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5994918399760489635.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/CTLFireability4194316282285641570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5994918399760489635.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 : 235/235 places, 746/746 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 194 transition count 309
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 194 transition count 309
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 122 place count 154 transition count 268
Iterating global reduction 0 with 40 rules applied. Total rules applied 162 place count 154 transition count 268
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 180 place count 154 transition count 250
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 196 place count 138 transition count 225
Iterating global reduction 1 with 16 rules applied. Total rules applied 212 place count 138 transition count 225
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 224 place count 138 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 228 place count 134 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 232 place count 134 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 131 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 239 place count 130 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 241 place count 129 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 242 place count 129 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 128 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 128 transition count 202
Applied a total of 244 rules in 30 ms. Remains 128 /235 variables (removed 107) and now considering 202/746 (removed 544) transitions.
// Phase 1: matrix 202 rows 128 cols
[2024-05-29 03:39:04] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 03:39:04] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 03:39:04] [INFO ] Invariant cache hit.
[2024-05-29 03:39:04] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-29 03:39:05] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-29 03:39:05] [INFO ] Invariant cache hit.
[2024-05-29 03:39:05] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 03:39:09] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 3 ms to minimize.
[2024-05-29 03:39:09] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/330 variables, 128/135 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 109/244 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 244 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18567 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/330 variables, 128/135 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 109/244 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 201/445 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 03:39:30] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-29 03:39:30] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-29 03:39:30] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 3/448 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/448 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/448 constraints. Problems are: Problem set: 3 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 448 constraints, problems are : Problem set: 3 solved, 198 unsolved in 25555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 5/5 constraints]
After SMT, in 44594ms problems are : Problem set: 3 solved, 198 unsolved
Search for dead transitions found 3 dead transitions in 44598ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 128/235 places, 199/746 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 199
Applied a total of 3 rules in 1 ms. Remains 125 /128 variables (removed 3) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 125 cols
[2024-05-29 03:39:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:39:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 03:39:49] [INFO ] Invariant cache hit.
[2024-05-29 03:39:49] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-29 03:39:50] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/235 places, 199/746 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46467 ms. Remains : 125/235 places, 199/746 transitions.
[2024-05-29 03:39:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:39:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:39:50] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-29 03:39:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:39:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:39:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9729392516511880809.gal : 1 ms
[2024-05-29 03:39:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5289688223074638967.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/CTLFireability9729392516511880809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5289688223074638967.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-29 03:40:20] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:40:20] [INFO ] Applying decomposition
[2024-05-29 03:40:20] [INFO ] Flatten gal took : 8 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/graph13757248361573729380.txt' '-o' '/tmp/graph13757248361573729380.bin' '-w' '/tmp/graph13757248361573729380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13757248361573729380.bin' '-l' '-1' '-v' '-w' '/tmp/graph13757248361573729380.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:40:20] [INFO ] Decomposing Gal with order
[2024-05-29 03:40:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:40:20] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-29 03:40:20] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:40:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 3 ms.
[2024-05-29 03:40:20] [INFO ] Time to serialize gal into /tmp/CTLFireability906756705190046751.gal : 3 ms
[2024-05-29 03:40:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2274874317011765361.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/CTLFireability906756705190046751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2274874317011765361.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.
[2024-05-29 03:40:50] [INFO ] Flatten gal took : 28 ms
[2024-05-29 03:40:50] [INFO ] Flatten gal took : 28 ms
[2024-05-29 03:40:50] [INFO ] Applying decomposition
[2024-05-29 03:40:50] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10818097967005140466.txt' '-o' '/tmp/graph10818097967005140466.bin' '-w' '/tmp/graph10818097967005140466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10818097967005140466.bin' '-l' '-1' '-v' '-w' '/tmp/graph10818097967005140466.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:40:50] [INFO ] Decomposing Gal with order
[2024-05-29 03:40:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:40:50] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-29 03:40:50] [INFO ] Flatten gal took : 30 ms
[2024-05-29 03:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 6 ms.
[2024-05-29 03:40:50] [INFO ] Time to serialize gal into /tmp/CTLFireability10476813843758808532.gal : 5 ms
[2024-05-29 03:40:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4272038761524741237.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/CTLFireability10476813843758808532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4272038761524741237.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.
Detected timeout of ITS tools.
[2024-05-29 04:09:59] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:09:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15641764834785051150.gal : 7 ms
[2024-05-29 04:09:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18183725123128778221.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/CTLFireability15641764834785051150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18183725123128778221.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 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="SieveSingleMsgMbox-PT-d2m96"
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 SieveSingleMsgMbox-PT-d2m96, 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 r378-smll-171683810800138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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