Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079600090.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 RingSingleMessageInMbox-PT-d1m080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079600090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 13 00:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 00:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716797985100

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 08:19:46] [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-27 08:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:19:46] [INFO ] Load time of PNML (sax parser for PT used): 473 ms
[2024-05-27 08:19:46] [INFO ] Transformed 6690 places.
[2024-05-27 08:19:46] [INFO ] Transformed 11934 transitions.
[2024-05-27 08:19:46] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 647 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 4305 places in 44 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 63 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1066 places :
Symmetric choice reduction at 1 with 1066 rule applications. Total rules 1185 place count 1302 transition count 10625
Iterating global reduction 1 with 1066 rules applied. Total rules applied 2251 place count 1302 transition count 10625
Ensure Unique test removed 435 transitions
Reduce isomorphic transitions removed 435 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 2686 place count 1302 transition count 10190
Discarding 862 places :
Symmetric choice reduction at 2 with 862 rule applications. Total rules 3548 place count 440 transition count 9328
Iterating global reduction 2 with 862 rules applied. Total rules applied 4410 place count 440 transition count 9328
Ensure Unique test removed 7190 transitions
Reduce isomorphic transitions removed 7190 transitions.
Iterating post reduction 2 with 7190 rules applied. Total rules applied 11600 place count 440 transition count 2138
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 11610 place count 430 transition count 2128
Iterating global reduction 3 with 10 rules applied. Total rules applied 11620 place count 430 transition count 2128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11622 place count 430 transition count 2126
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 11630 place count 422 transition count 2118
Iterating global reduction 4 with 8 rules applied. Total rules applied 11638 place count 422 transition count 2118
Applied a total of 11638 rules in 413 ms. Remains 422 /2385 variables (removed 1963) and now considering 2118/11934 (removed 9816) transitions.
// Phase 1: matrix 2118 rows 422 cols
[2024-05-27 08:19:47] [INFO ] Computed 3 invariants in 39 ms
[2024-05-27 08:19:48] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-27 08:19:48] [INFO ] Invariant cache hit.
[2024-05-27 08:19:48] [INFO ] State equation strengthened by 1738 read => feed constraints.
[2024-05-27 08:19:52] [INFO ] Implicit Places using invariants and state equation in 4718 ms returned []
Implicit Place search using SMT with State Equation took 5430 ms to find 0 implicit places.
Running 2117 sub problems to find dead transitions.
[2024-05-27 08:19:53] [INFO ] Invariant cache hit.
[2024-05-27 08:19:53] [INFO ] State equation strengthened by 1738 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2540 variables, and 3 constraints, problems are : Problem set: 0 solved, 2117 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1738 constraints, PredecessorRefiner: 2117/2117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2540 variables, and 3 constraints, problems are : Problem set: 0 solved, 2117 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1738 constraints, PredecessorRefiner: 0/2117 constraints, Known Traps: 0/0 constraints]
After SMT, in 72077ms problems are : Problem set: 0 solved, 2117 unsolved
Search for dead transitions found 0 dead transitions in 72114ms
Starting structural reductions in LTL mode, iteration 1 : 422/2385 places, 2118/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77999 ms. Remains : 422/2385 places, 2118/11934 transitions.
Support contains 63 out of 422 places after structural reductions.
[2024-05-27 08:21:05] [INFO ] Flatten gal took : 140 ms
[2024-05-27 08:21:05] [INFO ] Flatten gal took : 98 ms
[2024-05-27 08:21:05] [INFO ] Input system was already deterministic with 2118 transitions.
Reduction of identical properties reduced properties to check from 68 to 67
RANDOM walk for 40000 steps (6754 resets) in 3257 ms. (12 steps per ms) remains 8/67 properties
BEST_FIRST walk for 40003 steps (692 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (690 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (643 resets) in 146 ms. (272 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (367 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (640 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (673 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (680 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (892 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
[2024-05-27 08:21:07] [INFO ] Invariant cache hit.
[2024-05-27 08:21:07] [INFO ] State equation strengthened by 1738 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 111/132 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/139 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 45/184 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1116/1300 variables, 184/187 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 736/923 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/923 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 2540/2540 variables, and 1161 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 422/422 constraints, ReadFeed: 736/1738 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1725ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-27 08:21:09] [INFO ] Flatten gal took : 61 ms
[2024-05-27 08:21:09] [INFO ] Flatten gal took : 70 ms
[2024-05-27 08:21:09] [INFO ] Input system was already deterministic with 2118 transitions.
Support contains 55 out of 422 places (down from 56) after GAL structural reductions.
Computed a total of 137 stabilizing places and 1037 stable transitions
Graph (complete) has 2967 edges and 422 vertex of which 421 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 2118/2118 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 376 transition count 761
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 376 transition count 761
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 111 place count 376 transition count 742
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 179 place count 308 transition count 674
Iterating global reduction 1 with 68 rules applied. Total rules applied 247 place count 308 transition count 674
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 314 place count 308 transition count 607
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 422 place count 200 transition count 499
Iterating global reduction 2 with 108 rules applied. Total rules applied 530 place count 200 transition count 499
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 670 place count 200 transition count 359
Applied a total of 670 rules in 36 ms. Remains 200 /422 variables (removed 222) and now considering 359/2118 (removed 1759) transitions.
// Phase 1: matrix 359 rows 200 cols
[2024-05-27 08:21:09] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 08:21:09] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 08:21:09] [INFO ] Invariant cache hit.
[2024-05-27 08:21:09] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-27 08:21:09] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-05-27 08:21:09] [INFO ] Invariant cache hit.
[2024-05-27 08:21:09] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 4 (OVERLAPS) 359/559 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 173/376 constraints. Problems are: Problem set: 24 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/376 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 0/559 variables, 0/376 constraints. Problems are: Problem set: 24 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 376 constraints, problems are : Problem set: 24 solved, 334 unsolved in 13907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 17/192 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 8/200 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 359/559 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 173/376 constraints. Problems are: Problem set: 24 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 334/710 constraints. Problems are: Problem set: 24 solved, 334 unsolved
[2024-05-27 08:21:33] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 13 ms to minimize.
[2024-05-27 08:21:34] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:21:34] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-27 08:21:35] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:21:35] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
[2024-05-27 08:21:40] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
[2024-05-27 08:21:40] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 7/717 constraints. Problems are: Problem set: 46 solved, 312 unsolved
[2024-05-27 08:21:52] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 1/718 constraints. Problems are: Problem set: 46 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 718 constraints, problems are : Problem set: 46 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 334/358 constraints, Known Traps: 8/8 constraints]
After SMT, in 44660ms problems are : Problem set: 46 solved, 312 unsolved
Search for dead transitions found 46 dead transitions in 44670ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 200/422 places, 313/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 295
Applied a total of 60 rules in 3 ms. Remains 158 /200 variables (removed 42) and now considering 295/313 (removed 18) transitions.
// Phase 1: matrix 295 rows 158 cols
[2024-05-27 08:21:54] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:21:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 08:21:54] [INFO ] Invariant cache hit.
[2024-05-27 08:21:54] [INFO ] State equation strengthened by 165 read => feed constraints.
[2024-05-27 08:21:55] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/422 places, 295/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45834 ms. Remains : 158/422 places, 295/2118 transitions.
[2024-05-27 08:21:55] [INFO ] Flatten gal took : 17 ms
[2024-05-27 08:21:55] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:21:55] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-27 08:21:55] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:21:55] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6846127008853005867.gal : 15 ms
[2024-05-27 08:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16051389194778797743.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6846127008853005867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16051389194778797743.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-27 08:22:25] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:22:25] [INFO ] Applying decomposition
[2024-05-27 08:22:25] [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/graph14625090532970850170.txt' '-o' '/tmp/graph14625090532970850170.bin' '-w' '/tmp/graph14625090532970850170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14625090532970850170.bin' '-l' '-1' '-v' '-w' '/tmp/graph14625090532970850170.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:22:25] [INFO ] Decomposing Gal with order
[2024-05-27 08:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:22:25] [INFO ] Removed a total of 315 redundant transitions.
[2024-05-27 08:22:25] [INFO ] Flatten gal took : 83 ms
[2024-05-27 08:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 14 ms.
[2024-05-27 08:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11703467344956164106.gal : 4 ms
[2024-05-27 08:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4434722100962664237.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/CTLFireability11703467344956164106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4434722100962664237.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 : 422/422 places, 2118/2118 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 377 transition count 865
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 377 transition count 865
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 118 place count 377 transition count 837
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 185 place count 310 transition count 770
Iterating global reduction 1 with 67 rules applied. Total rules applied 252 place count 310 transition count 770
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 342 place count 310 transition count 680
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 442 place count 210 transition count 580
Iterating global reduction 2 with 100 rules applied. Total rules applied 542 place count 210 transition count 580
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 682 place count 210 transition count 440
Applied a total of 682 rules in 29 ms. Remains 210 /422 variables (removed 212) and now considering 440/2118 (removed 1678) transitions.
// Phase 1: matrix 440 rows 210 cols
[2024-05-27 08:22:55] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 08:22:55] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-27 08:22:55] [INFO ] Invariant cache hit.
[2024-05-27 08:22:56] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-27 08:22:56] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-27 08:22:56] [INFO ] Invariant cache hit.
[2024-05-27 08:22:56] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 4 (OVERLAPS) 440/650 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 246/459 constraints. Problems are: Problem set: 24 solved, 415 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/459 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 0/650 variables, 0/459 constraints. Problems are: Problem set: 24 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 459 constraints, problems are : Problem set: 24 solved, 415 unsolved in 18404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 17/202 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 8/210 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 440/650 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 246/459 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 415/874 constraints. Problems are: Problem set: 24 solved, 415 unsolved
[2024-05-27 08:23:30] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-27 08:23:30] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 3 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-27 08:23:36] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
[2024-05-27 08:23:36] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 2 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
[2024-05-27 08:23:36] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
[2024-05-27 08:23:37] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-05-27 08:23:37] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 7/881 constraints. Problems are: Problem set: 46 solved, 393 unsolved
[2024-05-27 08:23:43] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 882 constraints, problems are : Problem set: 46 solved, 393 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 415/439 constraints, Known Traps: 8/8 constraints]
After SMT, in 49336ms problems are : Problem set: 46 solved, 393 unsolved
Search for dead transitions found 46 dead transitions in 49340ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/422 places, 394/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 168 transition count 376
Applied a total of 60 rules in 3 ms. Remains 168 /210 variables (removed 42) and now considering 376/394 (removed 18) transitions.
// Phase 1: matrix 376 rows 168 cols
[2024-05-27 08:23:46] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:23:46] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 08:23:46] [INFO ] Invariant cache hit.
[2024-05-27 08:23:46] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-27 08:23:46] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 168/422 places, 376/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51217 ms. Remains : 168/422 places, 376/2118 transitions.
[2024-05-27 08:23:46] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:23:46] [INFO ] Flatten gal took : 17 ms
[2024-05-27 08:23:46] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-27 08:23:46] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:23:46] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6239237878855587930.gal : 3 ms
[2024-05-27 08:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8079145432496376525.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/CTLFireability6239237878855587930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8079145432496376525.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-27 08:24:16] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:24:16] [INFO ] Applying decomposition
[2024-05-27 08:24:16] [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/graph5170879279612862459.txt' '-o' '/tmp/graph5170879279612862459.bin' '-w' '/tmp/graph5170879279612862459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5170879279612862459.bin' '-l' '-1' '-v' '-w' '/tmp/graph5170879279612862459.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:24:16] [INFO ] Decomposing Gal with order
[2024-05-27 08:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:24:17] [INFO ] Removed a total of 461 redundant transitions.
[2024-05-27 08:24:17] [INFO ] Flatten gal took : 49 ms
[2024-05-27 08:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 10 ms.
[2024-05-27 08:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5694898336443769097.gal : 3 ms
[2024-05-27 08:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3501657410299123967.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/CTLFireability5694898336443769097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3501657410299123967.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 : 422/422 places, 2118/2118 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 384 transition count 1016
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 384 transition count 1016
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 98 place count 384 transition count 994
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 161 place count 321 transition count 931
Iterating global reduction 1 with 63 rules applied. Total rules applied 224 place count 321 transition count 931
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 334 place count 321 transition count 821
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 422 place count 233 transition count 733
Iterating global reduction 2 with 88 rules applied. Total rules applied 510 place count 233 transition count 733
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 686 place count 233 transition count 557
Applied a total of 686 rules in 25 ms. Remains 233 /422 variables (removed 189) and now considering 557/2118 (removed 1561) transitions.
// Phase 1: matrix 557 rows 233 cols
[2024-05-27 08:24:47] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:24:47] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-27 08:24:47] [INFO ] Invariant cache hit.
[2024-05-27 08:24:47] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-27 08:24:48] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2024-05-27 08:24:48] [INFO ] Invariant cache hit.
[2024-05-27 08:24:48] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
At refinement iteration 4 (OVERLAPS) 557/790 variables, 233/236 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/790 variables, 343/579 constraints. Problems are: Problem set: 24 solved, 532 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 0/579 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 7 (OVERLAPS) 0/790 variables, 0/579 constraints. Problems are: Problem set: 24 solved, 532 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 579 constraints, problems are : Problem set: 24 solved, 532 unsolved in 27042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 17/225 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 5 (OVERLAPS) 557/790 variables, 233/236 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 343/579 constraints. Problems are: Problem set: 24 solved, 532 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 532/1111 constraints. Problems are: Problem set: 24 solved, 532 unsolved
[2024-05-27 08:25:38] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:25:38] [INFO ] Deduced a trap composed of 106 places in 65 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-05-27 08:25:40] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-27 08:25:40] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 08:25:40] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-27 08:25:41] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/790 variables, and 1117 constraints, problems are : Problem set: 36 solved, 520 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 532/556 constraints, Known Traps: 6/6 constraints]
After SMT, in 58535ms problems are : Problem set: 36 solved, 520 unsolved
Search for dead transitions found 36 dead transitions in 58541ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 233/422 places, 521/2118 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 201 transition count 509
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 197 transition count 505
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 197 transition count 505
Applied a total of 52 rules in 5 ms. Remains 197 /233 variables (removed 36) and now considering 505/521 (removed 16) transitions.
// Phase 1: matrix 505 rows 197 cols
[2024-05-27 08:25:46] [INFO ] Computed 1 invariants in 5 ms
[2024-05-27 08:25:46] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 08:25:46] [INFO ] Invariant cache hit.
[2024-05-27 08:25:46] [INFO ] State equation strengthened by 335 read => feed constraints.
[2024-05-27 08:25:47] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 197/422 places, 505/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60315 ms. Remains : 197/422 places, 505/2118 transitions.
[2024-05-27 08:25:47] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:25:47] [INFO ] Flatten gal took : 32 ms
[2024-05-27 08:25:47] [INFO ] Input system was already deterministic with 505 transitions.
[2024-05-27 08:25:47] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:25:47] [INFO ] Flatten gal took : 26 ms
[2024-05-27 08:25:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1587272331348801385.gal : 2 ms
[2024-05-27 08:25:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16423631121431580082.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1587272331348801385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16423631121431580082.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-27 08:26:17] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:26:17] [INFO ] Applying decomposition
[2024-05-27 08:26:17] [INFO ] Flatten gal took : 12 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/graph5973340171453770676.txt' '-o' '/tmp/graph5973340171453770676.bin' '-w' '/tmp/graph5973340171453770676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5973340171453770676.bin' '-l' '-1' '-v' '-w' '/tmp/graph5973340171453770676.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:26:17] [INFO ] Decomposing Gal with order
[2024-05-27 08:26:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:26:17] [INFO ] Removed a total of 598 redundant transitions.
[2024-05-27 08:26:17] [INFO ] Flatten gal took : 47 ms
[2024-05-27 08:26:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 455 labels/synchronizations in 15 ms.
[2024-05-27 08:26:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15174164275326039446.gal : 3 ms
[2024-05-27 08:26:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4175294866077841272.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/CTLFireability15174164275326039446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4175294866077841272.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 422/422 places, 2118/2118 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 376 transition count 764
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 376 transition count 764
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 110 place count 376 transition count 746
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 179 place count 307 transition count 677
Iterating global reduction 1 with 69 rules applied. Total rules applied 248 place count 307 transition count 677
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 318 place count 307 transition count 607
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 426 place count 199 transition count 499
Iterating global reduction 2 with 108 rules applied. Total rules applied 534 place count 199 transition count 499
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 682 place count 199 transition count 351
Applied a total of 682 rules in 74 ms. Remains 199 /422 variables (removed 223) and now considering 351/2118 (removed 1767) transitions.
// Phase 1: matrix 351 rows 199 cols
[2024-05-27 08:26:47] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:26:48] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 08:26:48] [INFO ] Invariant cache hit.
[2024-05-27 08:26:48] [INFO ] State equation strengthened by 166 read => feed constraints.
[2024-05-27 08:26:48] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-27 08:26:48] [INFO ] Redundant transitions in 23 ms returned []
Running 350 sub problems to find dead transitions.
[2024-05-27 08:26:48] [INFO ] Invariant cache hit.
[2024-05-27 08:26:48] [INFO ] State equation strengthened by 166 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 4 (OVERLAPS) 351/550 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 166/368 constraints. Problems are: Problem set: 24 solved, 326 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/368 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 0/550 variables, 0/368 constraints. Problems are: Problem set: 24 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 368 constraints, problems are : Problem set: 24 solved, 326 unsolved in 15910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 17/191 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 8/199 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 351/550 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 166/368 constraints. Problems are: Problem set: 24 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 326/694 constraints. Problems are: Problem set: 24 solved, 326 unsolved
[2024-05-27 08:27:14] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 08:27:16] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 08:27:16] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 2 ms to minimize.
[2024-05-27 08:27:16] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
[2024-05-27 08:27:20] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
[2024-05-27 08:27:21] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 6/700 constraints. Problems are: Problem set: 46 solved, 304 unsolved
[2024-05-27 08:27:28] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/701 constraints. Problems are: Problem set: 46 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 701 constraints, problems are : Problem set: 46 solved, 304 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 326/350 constraints, Known Traps: 7/7 constraints]
After SMT, in 46634ms problems are : Problem set: 46 solved, 304 unsolved
Search for dead transitions found 46 dead transitions in 46637ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 199/422 places, 305/2118 transitions.
Graph (complete) has 659 edges and 199 vertex of which 157 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 157 transition count 287
Applied a total of 19 rules in 16 ms. Remains 157 /199 variables (removed 42) and now considering 287/305 (removed 18) transitions.
// Phase 1: matrix 287 rows 157 cols
[2024-05-27 08:27:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:27:35] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 08:27:35] [INFO ] Invariant cache hit.
[2024-05-27 08:27:35] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-27 08:27:36] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 157/422 places, 287/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48119 ms. Remains : 157/422 places, 287/2118 transitions.
[2024-05-27 08:27:36] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:27:36] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:27:36] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-27 08:27:36] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:27:36] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14405000524262585700.gal : 2 ms
[2024-05-27 08:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12143718448558496374.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/CTLFireability14405000524262585700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12143718448558496374.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-27 08:28:06] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:28:06] [INFO ] Applying decomposition
[2024-05-27 08:28:06] [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/graph794352994484180670.txt' '-o' '/tmp/graph794352994484180670.bin' '-w' '/tmp/graph794352994484180670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph794352994484180670.bin' '-l' '-1' '-v' '-w' '/tmp/graph794352994484180670.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:28:06] [INFO ] Decomposing Gal with order
[2024-05-27 08:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:28:06] [INFO ] Removed a total of 310 redundant transitions.
[2024-05-27 08:28:06] [INFO ] Flatten gal took : 29 ms
[2024-05-27 08:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 5 ms.
[2024-05-27 08:28:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5264318300433398863.gal : 2 ms
[2024-05-27 08:28:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5357576789072940982.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/CTLFireability5264318300433398863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5357576789072940982.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 : 422/422 places, 2118/2118 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 373 transition count 664
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 373 transition count 664
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 373 transition count 651
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 182 place count 302 transition count 580
Iterating global reduction 1 with 71 rules applied. Total rules applied 253 place count 302 transition count 580
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 305 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 421 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 537 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 653 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 655 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 658 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 659 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 663 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 667 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 679 place count 179 transition count 253
Applied a total of 679 rules in 54 ms. Remains 179 /422 variables (removed 243) and now considering 253/2118 (removed 1865) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 08:28:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 08:28:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:28:36] [INFO ] Invariant cache hit.
[2024-05-27 08:28:36] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 08:28:36] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-27 08:28:36] [INFO ] Redundant transitions in 6 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-27 08:28:36] [INFO ] Invariant cache hit.
[2024-05-27 08:28:36] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 7705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
[2024-05-27 08:28:50] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 08:28:51] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 08:28:51] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-27 08:28:53] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-27 08:28:53] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 3 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 08:28:53] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:28:53] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 7/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-27 08:29:04] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/432 variables, 1/502 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/502 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 502 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 8/8 constraints]
After SMT, in 38103ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 38107ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/422 places, 207/2118 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 14 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:29:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:29:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 08:29:15] [INFO ] Invariant cache hit.
[2024-05-27 08:29:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:29:15] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/422 places, 189/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 38976 ms. Remains : 137/422 places, 189/2118 transitions.
[2024-05-27 08:29:15] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:29:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:29:15] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-27 08:29:15] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:29:15] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:29:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1216285601755264355.gal : 1 ms
[2024-05-27 08:29:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15274577436829217109.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/CTLFireability1216285601755264355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15274577436829217109.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-27 08:29:45] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:29:45] [INFO ] Applying decomposition
[2024-05-27 08:29:45] [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/graph816649486145094397.txt' '-o' '/tmp/graph816649486145094397.bin' '-w' '/tmp/graph816649486145094397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph816649486145094397.bin' '-l' '-1' '-v' '-w' '/tmp/graph816649486145094397.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:29:45] [INFO ] Decomposing Gal with order
[2024-05-27 08:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:29:45] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-27 08:29:45] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 5 ms.
[2024-05-27 08:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8671184892026243062.gal : 2 ms
[2024-05-27 08:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10267507038742707506.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/CTLFireability8671184892026243062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10267507038742707506.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 : 422/422 places, 2118/2118 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 378 transition count 863
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 378 transition count 863
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 115 place count 378 transition count 836
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 150 place count 343 transition count 801
Iterating global reduction 1 with 35 rules applied. Total rules applied 185 place count 343 transition count 801
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 201 place count 343 transition count 785
Discarding 125 places :
Symmetric choice reduction at 2 with 125 rule applications. Total rules 326 place count 218 transition count 660
Iterating global reduction 2 with 125 rules applied. Total rules applied 451 place count 218 transition count 660
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 2 with 220 rules applied. Total rules applied 671 place count 218 transition count 440
Applied a total of 671 rules in 18 ms. Remains 218 /422 variables (removed 204) and now considering 440/2118 (removed 1678) transitions.
// Phase 1: matrix 440 rows 218 cols
[2024-05-27 08:30:15] [INFO ] Computed 3 invariants in 9 ms
[2024-05-27 08:30:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 08:30:15] [INFO ] Invariant cache hit.
[2024-05-27 08:30:15] [INFO ] State equation strengthened by 239 read => feed constraints.
[2024-05-27 08:30:16] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-27 08:30:16] [INFO ] Invariant cache hit.
[2024-05-27 08:30:16] [INFO ] State equation strengthened by 239 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/218 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 4 (OVERLAPS) 440/658 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 239/460 constraints. Problems are: Problem set: 24 solved, 415 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/460 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 0/658 variables, 0/460 constraints. Problems are: Problem set: 24 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 460 constraints, problems are : Problem set: 24 solved, 415 unsolved in 20251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 17/210 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 8/218 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 440/658 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 239/460 constraints. Problems are: Problem set: 24 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 415/875 constraints. Problems are: Problem set: 24 solved, 415 unsolved
[2024-05-27 08:30:51] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 1 ms to minimize.
[2024-05-27 08:30:51] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
[2024-05-27 08:30:52] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-27 08:30:52] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-27 08:30:58] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
[2024-05-27 08:30:58] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
[2024-05-27 08:30:59] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 2 ms to minimize.
[2024-05-27 08:30:59] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
[2024-05-27 08:30:59] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:31:00] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:31:00] [INFO ] Deduced a trap composed of 107 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:31:00] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 12/887 constraints. Problems are: Problem set: 46 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 887 constraints, problems are : Problem set: 46 solved, 393 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 415/439 constraints, Known Traps: 12/12 constraints]
After SMT, in 51247ms problems are : Problem set: 46 solved, 393 unsolved
Search for dead transitions found 46 dead transitions in 51256ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 218/422 places, 394/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 176 transition count 376
Applied a total of 60 rules in 2 ms. Remains 176 /218 variables (removed 42) and now considering 376/394 (removed 18) transitions.
// Phase 1: matrix 376 rows 176 cols
[2024-05-27 08:31:08] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:31:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 08:31:08] [INFO ] Invariant cache hit.
[2024-05-27 08:31:08] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-27 08:31:08] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/422 places, 376/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53310 ms. Remains : 176/422 places, 376/2118 transitions.
[2024-05-27 08:31:08] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:31:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:31:08] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-27 08:31:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:31:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11472999406974679679.gal : 1 ms
[2024-05-27 08:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6334070923152238670.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/CTLFireability11472999406974679679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6334070923152238670.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-27 08:31:38] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:31:38] [INFO ] Applying decomposition
[2024-05-27 08:31:38] [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/graph15055824401013410235.txt' '-o' '/tmp/graph15055824401013410235.bin' '-w' '/tmp/graph15055824401013410235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15055824401013410235.bin' '-l' '-1' '-v' '-w' '/tmp/graph15055824401013410235.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:31:38] [INFO ] Decomposing Gal with order
[2024-05-27 08:31:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:31:38] [INFO ] Removed a total of 522 redundant transitions.
[2024-05-27 08:31:38] [INFO ] Flatten gal took : 23 ms
[2024-05-27 08:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 7 ms.
[2024-05-27 08:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13179851037150699280.gal : 3 ms
[2024-05-27 08:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2976856557303077348.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/CTLFireability13179851037150699280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2976856557303077348.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 : 422/422 places, 2118/2118 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 376 transition count 758
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 376 transition count 758
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 106 place count 376 transition count 744
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 175 place count 307 transition count 675
Iterating global reduction 1 with 69 rules applied. Total rules applied 244 place count 307 transition count 675
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 310 place count 307 transition count 609
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 418 place count 199 transition count 501
Iterating global reduction 2 with 108 rules applied. Total rules applied 526 place count 199 transition count 501
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 658 place count 199 transition count 369
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 659 place count 198 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 660 place count 198 transition count 356
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 661 place count 197 transition count 355
Iterating global reduction 3 with 1 rules applied. Total rules applied 662 place count 197 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 663 place count 197 transition count 354
Applied a total of 663 rules in 27 ms. Remains 197 /422 variables (removed 225) and now considering 354/2118 (removed 1764) transitions.
// Phase 1: matrix 354 rows 197 cols
[2024-05-27 08:32:09] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 08:32:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 08:32:09] [INFO ] Invariant cache hit.
[2024-05-27 08:32:09] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-27 08:32:09] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-27 08:32:09] [INFO ] Invariant cache hit.
[2024-05-27 08:32:09] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 4 (OVERLAPS) 354/551 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 170/370 constraints. Problems are: Problem set: 24 solved, 329 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/370 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 0/551 variables, 0/370 constraints. Problems are: Problem set: 24 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 370 constraints, problems are : Problem set: 24 solved, 329 unsolved in 13462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 17/189 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 354/551 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 170/370 constraints. Problems are: Problem set: 24 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 329/699 constraints. Problems are: Problem set: 24 solved, 329 unsolved
[2024-05-27 08:32:33] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-27 08:32:34] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-27 08:32:34] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
[2024-05-27 08:32:38] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
[2024-05-27 08:32:38] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:32:38] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 6/705 constraints. Problems are: Problem set: 46 solved, 307 unsolved
[2024-05-27 08:32:48] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 8 ms to minimize.
[2024-05-27 08:32:48] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 2 ms to minimize.
[2024-05-27 08:32:48] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 2 ms to minimize.
[2024-05-27 08:32:49] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 4/709 constraints. Problems are: Problem set: 46 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 709 constraints, problems are : Problem set: 46 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 329/353 constraints, Known Traps: 10/10 constraints]
After SMT, in 44256ms problems are : Problem set: 46 solved, 307 unsolved
Search for dead transitions found 46 dead transitions in 44262ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/422 places, 308/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 155 transition count 290
Applied a total of 60 rules in 3 ms. Remains 155 /197 variables (removed 42) and now considering 290/308 (removed 18) transitions.
// Phase 1: matrix 290 rows 155 cols
[2024-05-27 08:32:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:32:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 08:32:54] [INFO ] Invariant cache hit.
[2024-05-27 08:32:54] [INFO ] State equation strengthened by 162 read => feed constraints.
[2024-05-27 08:32:54] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/422 places, 290/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45801 ms. Remains : 155/422 places, 290/2118 transitions.
[2024-05-27 08:32:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:32:54] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:32:54] [INFO ] Input system was already deterministic with 290 transitions.
[2024-05-27 08:32:54] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:32:54] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:32:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2607197899381791066.gal : 2 ms
[2024-05-27 08:32:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4723382094468792221.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/CTLFireability2607197899381791066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4723382094468792221.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-27 08:33:24] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:33:24] [INFO ] Applying decomposition
[2024-05-27 08:33:24] [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/graph10742072438077142372.txt' '-o' '/tmp/graph10742072438077142372.bin' '-w' '/tmp/graph10742072438077142372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10742072438077142372.bin' '-l' '-1' '-v' '-w' '/tmp/graph10742072438077142372.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:33:24] [INFO ] Decomposing Gal with order
[2024-05-27 08:33:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:33:24] [INFO ] Removed a total of 310 redundant transitions.
[2024-05-27 08:33:24] [INFO ] Flatten gal took : 22 ms
[2024-05-27 08:33:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 3 ms.
[2024-05-27 08:33:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5135756201264152595.gal : 2 ms
[2024-05-27 08:33:25] [INFO ] Time to serialize properties into /tmp/CTLFireability1249086761615708136.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/CTLFireability5135756201264152595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1249086761615708136.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 : 422/422 places, 2118/2118 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 373 transition count 614
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 373 transition count 614
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 373 transition count 605
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 178 place count 302 transition count 534
Iterating global reduction 1 with 71 rules applied. Total rules applied 249 place count 302 transition count 534
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 290 place count 302 transition count 493
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 410 place count 182 transition count 373
Iterating global reduction 2 with 120 rules applied. Total rules applied 530 place count 182 transition count 373
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 626 place count 182 transition count 277
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 628 place count 180 transition count 251
Iterating global reduction 3 with 2 rules applied. Total rules applied 630 place count 180 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 631 place count 179 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 632 place count 179 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 636 place count 175 transition count 246
Iterating global reduction 3 with 4 rules applied. Total rules applied 640 place count 175 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 648 place count 175 transition count 238
Applied a total of 648 rules in 24 ms. Remains 175 /422 variables (removed 247) and now considering 238/2118 (removed 1880) transitions.
// Phase 1: matrix 238 rows 175 cols
[2024-05-27 08:33:55] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:33:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-27 08:33:55] [INFO ] Invariant cache hit.
[2024-05-27 08:33:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 08:33:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-05-27 08:33:55] [INFO ] Invariant cache hit.
[2024-05-27 08:33:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 4 (OVERLAPS) 238/413 variables, 175/178 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 72/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 250 constraints, problems are : Problem set: 24 solved, 213 unsolved in 8114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 17/167 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 8/175 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 238/413 variables, 175/178 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 72/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 213/463 constraints. Problems are: Problem set: 24 solved, 213 unsolved
[2024-05-27 08:34:08] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 08:34:09] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:34:09] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-27 08:34:10] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 08:34:11] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
[2024-05-27 08:34:11] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-05-27 08:34:11] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 7/470 constraints. Problems are: Problem set: 46 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/470 constraints. Problems are: Problem set: 46 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/470 constraints. Problems are: Problem set: 46 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 470 constraints, problems are : Problem set: 46 solved, 191 unsolved in 21061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 213/237 constraints, Known Traps: 7/7 constraints]
After SMT, in 29516ms problems are : Problem set: 46 solved, 191 unsolved
Search for dead transitions found 46 dead transitions in 29519ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/422 places, 192/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 133 transition count 174
Applied a total of 60 rules in 3 ms. Remains 133 /175 variables (removed 42) and now considering 174/192 (removed 18) transitions.
// Phase 1: matrix 174 rows 133 cols
[2024-05-27 08:34:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:34:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 08:34:25] [INFO ] Invariant cache hit.
[2024-05-27 08:34:25] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 08:34:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/422 places, 174/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30305 ms. Remains : 133/422 places, 174/2118 transitions.
[2024-05-27 08:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:34:25] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-27 08:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12483066324389469717.gal : 1 ms
[2024-05-27 08:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6605216960243462485.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/CTLFireability12483066324389469717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6605216960243462485.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-27 08:34:55] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:34:55] [INFO ] Applying decomposition
[2024-05-27 08:34:55] [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/graph3653365984513031649.txt' '-o' '/tmp/graph3653365984513031649.bin' '-w' '/tmp/graph3653365984513031649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3653365984513031649.bin' '-l' '-1' '-v' '-w' '/tmp/graph3653365984513031649.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:34:55] [INFO ] Decomposing Gal with order
[2024-05-27 08:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:34:55] [INFO ] Removed a total of 183 redundant transitions.
[2024-05-27 08:34:55] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:34:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 2 ms.
[2024-05-27 08:34:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8672819542146269288.gal : 1 ms
[2024-05-27 08:34:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8289593181209741525.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/CTLFireability8672819542146269288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8289593181209741525.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 : 422/422 places, 2118/2118 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 379 transition count 914
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 379 transition count 914
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 117 place count 379 transition count 883
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 182 place count 314 transition count 818
Iterating global reduction 1 with 65 rules applied. Total rules applied 247 place count 314 transition count 818
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 344 place count 314 transition count 721
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 440 place count 218 transition count 625
Iterating global reduction 2 with 96 rules applied. Total rules applied 536 place count 218 transition count 625
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 2 with 184 rules applied. Total rules applied 720 place count 218 transition count 441
Applied a total of 720 rules in 57 ms. Remains 218 /422 variables (removed 204) and now considering 441/2118 (removed 1677) transitions.
// Phase 1: matrix 441 rows 218 cols
[2024-05-27 08:35:25] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 08:35:25] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 08:35:25] [INFO ] Invariant cache hit.
[2024-05-27 08:35:25] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-27 08:35:26] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2024-05-27 08:35:26] [INFO ] Redundant transitions in 12 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-27 08:35:26] [INFO ] Invariant cache hit.
[2024-05-27 08:35:26] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 4 (OVERLAPS) 441/659 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 240/461 constraints. Problems are: Problem set: 24 solved, 416 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 0/461 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 7 (OVERLAPS) 0/659 variables, 0/461 constraints. Problems are: Problem set: 24 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 461 constraints, problems are : Problem set: 24 solved, 416 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 17/210 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 8/218 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 441/659 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 240/461 constraints. Problems are: Problem set: 24 solved, 416 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 416/877 constraints. Problems are: Problem set: 24 solved, 416 unsolved
[2024-05-27 08:36:01] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:36:01] [INFO ] Deduced a trap composed of 106 places in 54 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 08:36:02] [INFO ] Deduced a trap composed of 97 places in 50 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-27 08:36:02] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-05-27 08:36:09] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-05-27 08:36:09] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
[2024-05-27 08:36:10] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:36:10] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 8/885 constraints. Problems are: Problem set: 46 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 885 constraints, problems are : Problem set: 46 solved, 394 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 416/440 constraints, Known Traps: 8/8 constraints]
After SMT, in 50981ms problems are : Problem set: 46 solved, 394 unsolved
Search for dead transitions found 46 dead transitions in 50985ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 218/422 places, 395/2118 transitions.
Graph (complete) has 784 edges and 218 vertex of which 176 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 176 transition count 377
Applied a total of 19 rules in 14 ms. Remains 176 /218 variables (removed 42) and now considering 377/395 (removed 18) transitions.
// Phase 1: matrix 377 rows 176 cols
[2024-05-27 08:36:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:36:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:36:17] [INFO ] Invariant cache hit.
[2024-05-27 08:36:17] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-27 08:36:18] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 176/422 places, 377/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 52651 ms. Remains : 176/422 places, 377/2118 transitions.
[2024-05-27 08:36:18] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:36:18] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:36:18] [INFO ] Input system was already deterministic with 377 transitions.
[2024-05-27 08:36:18] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:36:18] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:36:18] [INFO ] Time to serialize gal into /tmp/CTLFireability18334428725167578566.gal : 2 ms
[2024-05-27 08:36:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3957191141169020041.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/CTLFireability18334428725167578566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3957191141169020041.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-27 08:36:48] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:36:48] [INFO ] Applying decomposition
[2024-05-27 08:36:48] [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/graph10605814519252422169.txt' '-o' '/tmp/graph10605814519252422169.bin' '-w' '/tmp/graph10605814519252422169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10605814519252422169.bin' '-l' '-1' '-v' '-w' '/tmp/graph10605814519252422169.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:36:48] [INFO ] Decomposing Gal with order
[2024-05-27 08:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:36:48] [INFO ] Removed a total of 307 redundant transitions.
[2024-05-27 08:36:48] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 3 ms.
[2024-05-27 08:36:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16016497427693292496.gal : 2 ms
[2024-05-27 08:36:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9563219851498703796.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/CTLFireability16016497427693292496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9563219851498703796.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 422/422 places, 2118/2118 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 377 transition count 868
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 377 transition count 868
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 119 place count 377 transition count 839
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 186 place count 310 transition count 772
Iterating global reduction 1 with 67 rules applied. Total rules applied 253 place count 310 transition count 772
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 345 place count 310 transition count 680
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 445 place count 210 transition count 580
Iterating global reduction 2 with 100 rules applied. Total rules applied 545 place count 210 transition count 580
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 721 place count 210 transition count 404
Applied a total of 721 rules in 47 ms. Remains 210 /422 variables (removed 212) and now considering 404/2118 (removed 1714) transitions.
// Phase 1: matrix 404 rows 210 cols
[2024-05-27 08:37:18] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 08:37:18] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:37:18] [INFO ] Invariant cache hit.
[2024-05-27 08:37:18] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-27 08:37:19] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2024-05-27 08:37:19] [INFO ] Redundant transitions in 6 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 08:37:19] [INFO ] Invariant cache hit.
[2024-05-27 08:37:19] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 4 (OVERLAPS) 404/614 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 210/423 constraints. Problems are: Problem set: 24 solved, 379 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/423 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 0/614 variables, 0/423 constraints. Problems are: Problem set: 24 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 423 constraints, problems are : Problem set: 24 solved, 379 unsolved in 20003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 17/202 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 3 (OVERLAPS) 8/210 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 404/614 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 210/423 constraints. Problems are: Problem set: 24 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 379/802 constraints. Problems are: Problem set: 24 solved, 379 unsolved
[2024-05-27 08:37:51] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:37:52] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-27 08:37:53] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
[2024-05-27 08:37:57] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
[2024-05-27 08:37:57] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
Problem TDEAD351 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
[2024-05-27 08:37:58] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 6/808 constraints. Problems are: Problem set: 46 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/614 variables, and 808 constraints, problems are : Problem set: 46 solved, 357 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 379/403 constraints, Known Traps: 6/6 constraints]
After SMT, in 50819ms problems are : Problem set: 46 solved, 357 unsolved
Search for dead transitions found 46 dead transitions in 50824ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 210/422 places, 358/2118 transitions.
Graph (complete) has 732 edges and 210 vertex of which 168 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 168 transition count 340
Applied a total of 19 rules in 11 ms. Remains 168 /210 variables (removed 42) and now considering 340/358 (removed 18) transitions.
// Phase 1: matrix 340 rows 168 cols
[2024-05-27 08:38:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:38:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:38:10] [INFO ] Invariant cache hit.
[2024-05-27 08:38:10] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 08:38:11] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 168/422 places, 340/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 53318 ms. Remains : 168/422 places, 340/2118 transitions.
[2024-05-27 08:38:11] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:38:11] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:38:11] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-27 08:38:11] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:38:11] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:38:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3401467604893904086.gal : 2 ms
[2024-05-27 08:38:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15937084625882416324.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/CTLFireability3401467604893904086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15937084625882416324.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-27 08:38:41] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:38:41] [INFO ] Applying decomposition
[2024-05-27 08:38:41] [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/graph14354225583676660040.txt' '-o' '/tmp/graph14354225583676660040.bin' '-w' '/tmp/graph14354225583676660040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14354225583676660040.bin' '-l' '-1' '-v' '-w' '/tmp/graph14354225583676660040.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:38:41] [INFO ] Decomposing Gal with order
[2024-05-27 08:38:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:38:41] [INFO ] Removed a total of 305 redundant transitions.
[2024-05-27 08:38:41] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 2 ms.
[2024-05-27 08:38:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8313131098712013488.gal : 3 ms
[2024-05-27 08:38:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17121297040029309140.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/CTLFireability8313131098712013488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17121297040029309140.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 : 422/422 places, 2118/2118 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 374 transition count 712
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 374 transition count 712
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 112 place count 374 transition count 696
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 182 place count 304 transition count 626
Iterating global reduction 1 with 70 rules applied. Total rules applied 252 place count 304 transition count 626
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 312 place count 304 transition count 566
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 424 place count 192 transition count 454
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 672 place count 192 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 674 place count 190 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 676 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 677 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 189 transition count 291
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 682 place count 185 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 686 place count 185 transition count 287
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 702 place count 185 transition count 271
Applied a total of 702 rules in 32 ms. Remains 185 /422 variables (removed 237) and now considering 271/2118 (removed 1847) transitions.
// Phase 1: matrix 271 rows 185 cols
[2024-05-27 08:39:12] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:39:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-27 08:39:12] [INFO ] Invariant cache hit.
[2024-05-27 08:39:12] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-27 08:39:12] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-27 08:39:12] [INFO ] Invariant cache hit.
[2024-05-27 08:39:12] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 4 (OVERLAPS) 271/456 variables, 185/188 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 97/285 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 285 constraints, problems are : Problem set: 24 solved, 246 unsolved in 9784 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 17/177 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 8/185 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 271/456 variables, 185/188 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 97/285 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 246/531 constraints. Problems are: Problem set: 24 solved, 246 unsolved
[2024-05-27 08:39:29] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 3 ms to minimize.
[2024-05-27 08:39:29] [INFO ] Deduced a trap composed of 91 places in 43 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:39:30] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:39:30] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
[2024-05-27 08:39:33] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:39:33] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 6/537 constraints. Problems are: Problem set: 46 solved, 224 unsolved
[2024-05-27 08:39:40] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:39:40] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-27 08:39:40] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 3/540 constraints. Problems are: Problem set: 46 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/540 constraints. Problems are: Problem set: 46 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 540 constraints, problems are : Problem set: 46 solved, 224 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 246/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 40217ms problems are : Problem set: 46 solved, 224 unsolved
Search for dead transitions found 46 dead transitions in 40221ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/422 places, 225/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 143 transition count 207
Applied a total of 60 rules in 2 ms. Remains 143 /185 variables (removed 42) and now considering 207/225 (removed 18) transitions.
// Phase 1: matrix 207 rows 143 cols
[2024-05-27 08:39:52] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:39:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 08:39:52] [INFO ] Invariant cache hit.
[2024-05-27 08:39:52] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-27 08:39:53] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/422 places, 207/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41153 ms. Remains : 143/422 places, 207/2118 transitions.
[2024-05-27 08:39:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:39:53] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-27 08:39:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:39:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:39:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4969285159769127273.gal : 1 ms
[2024-05-27 08:39:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4954487470814610501.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/CTLFireability4969285159769127273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4954487470814610501.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-27 08:40:23] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:40:23] [INFO ] Applying decomposition
[2024-05-27 08:40:23] [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/graph9091472364139009715.txt' '-o' '/tmp/graph9091472364139009715.bin' '-w' '/tmp/graph9091472364139009715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9091472364139009715.bin' '-l' '-1' '-v' '-w' '/tmp/graph9091472364139009715.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:40:23] [INFO ] Decomposing Gal with order
[2024-05-27 08:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:40:23] [INFO ] Removed a total of 220 redundant transitions.
[2024-05-27 08:40:23] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 4 ms.
[2024-05-27 08:40:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12368339552024218831.gal : 2 ms
[2024-05-27 08:40:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1151287596264642585.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/CTLFireability12368339552024218831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1151287596264642585.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 : 422/422 places, 2118/2118 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 377 transition count 809
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 377 transition count 809
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 112 place count 377 transition count 787
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 179 place count 310 transition count 720
Iterating global reduction 1 with 67 rules applied. Total rules applied 246 place count 310 transition count 720
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 321 place count 310 transition count 645
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 425 place count 206 transition count 541
Iterating global reduction 2 with 104 rules applied. Total rules applied 529 place count 206 transition count 541
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 677 place count 206 transition count 393
Applied a total of 677 rules in 24 ms. Remains 206 /422 variables (removed 216) and now considering 393/2118 (removed 1725) transitions.
// Phase 1: matrix 393 rows 206 cols
[2024-05-27 08:40:53] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 08:40:53] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:40:53] [INFO ] Invariant cache hit.
[2024-05-27 08:40:53] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 08:40:54] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-27 08:40:54] [INFO ] Invariant cache hit.
[2024-05-27 08:40:54] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (OVERLAPS) 393/599 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 202/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/599 variables, 0/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 411 constraints, problems are : Problem set: 24 solved, 368 unsolved in 16066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 393/599 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 202/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 368/779 constraints. Problems are: Problem set: 24 solved, 368 unsolved
[2024-05-27 08:41:22] [INFO ] Deduced a trap composed of 106 places in 50 ms of which 1 ms to minimize.
[2024-05-27 08:41:22] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-27 08:41:23] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-27 08:41:23] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
[2024-05-27 08:41:27] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
[2024-05-27 08:41:28] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
[2024-05-27 08:41:28] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:41:28] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 8/787 constraints. Problems are: Problem set: 46 solved, 346 unsolved
[2024-05-27 08:41:36] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/599 variables, and 788 constraints, problems are : Problem set: 46 solved, 346 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 368/392 constraints, Known Traps: 9/9 constraints]
After SMT, in 46844ms problems are : Problem set: 46 solved, 346 unsolved
Search for dead transitions found 46 dead transitions in 46851ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/422 places, 347/2118 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 164 transition count 329
Applied a total of 60 rules in 2 ms. Remains 164 /206 variables (removed 42) and now considering 329/347 (removed 18) transitions.
// Phase 1: matrix 329 rows 164 cols
[2024-05-27 08:41:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:41:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 08:41:41] [INFO ] Invariant cache hit.
[2024-05-27 08:41:41] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-27 08:41:41] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/422 places, 329/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48151 ms. Remains : 164/422 places, 329/2118 transitions.
[2024-05-27 08:41:41] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:41:41] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:41:41] [INFO ] Input system was already deterministic with 329 transitions.
[2024-05-27 08:41:41] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:41:41] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:41:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15549156438697517985.gal : 2 ms
[2024-05-27 08:41:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6159881711290000210.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/CTLFireability15549156438697517985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6159881711290000210.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-27 08:42:11] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:42:11] [INFO ] Applying decomposition
[2024-05-27 08:42:11] [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/graph4160414485811449407.txt' '-o' '/tmp/graph4160414485811449407.bin' '-w' '/tmp/graph4160414485811449407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4160414485811449407.bin' '-l' '-1' '-v' '-w' '/tmp/graph4160414485811449407.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:42:11] [INFO ] Decomposing Gal with order
[2024-05-27 08:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:42:11] [INFO ] Removed a total of 397 redundant transitions.
[2024-05-27 08:42:11] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 3 ms.
[2024-05-27 08:42:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8567425754279471898.gal : 1 ms
[2024-05-27 08:42:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8576644978726745568.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/CTLFireability8567425754279471898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8576644978726745568.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 : 422/422 places, 2118/2118 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 385 transition count 1158
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 385 transition count 1158
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 120 place count 385 transition count 1112
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 180 place count 325 transition count 1052
Iterating global reduction 1 with 60 rules applied. Total rules applied 240 place count 325 transition count 1052
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 379 place count 325 transition count 913
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 455 place count 249 transition count 837
Iterating global reduction 2 with 76 rules applied. Total rules applied 531 place count 249 transition count 837
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 783 place count 249 transition count 585
Applied a total of 783 rules in 19 ms. Remains 249 /422 variables (removed 173) and now considering 585/2118 (removed 1533) transitions.
// Phase 1: matrix 585 rows 249 cols
[2024-05-27 08:42:41] [INFO ] Computed 3 invariants in 10 ms
[2024-05-27 08:42:41] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 08:42:41] [INFO ] Invariant cache hit.
[2024-05-27 08:42:41] [INFO ] State equation strengthened by 358 read => feed constraints.
[2024-05-27 08:42:42] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-27 08:42:42] [INFO ] Invariant cache hit.
[2024-05-27 08:42:42] [INFO ] State equation strengthened by 358 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (OVERLAPS) 1/249 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
At refinement iteration 4 (OVERLAPS) 585/834 variables, 249/252 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 358/610 constraints. Problems are: Problem set: 24 solved, 560 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 0/610 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 7 (OVERLAPS) 0/834 variables, 0/610 constraints. Problems are: Problem set: 24 solved, 560 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 610 constraints, problems are : Problem set: 24 solved, 560 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 249/249 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 17/241 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 3 (OVERLAPS) 8/249 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 5 (OVERLAPS) 585/834 variables, 249/252 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 358/610 constraints. Problems are: Problem set: 24 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 560/1170 constraints. Problems are: Problem set: 24 solved, 560 unsolved
[2024-05-27 08:43:39] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
[2024-05-27 08:43:39] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
[2024-05-27 08:43:39] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/834 variables, and 1173 constraints, problems are : Problem set: 36 solved, 548 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 249/249 constraints, ReadFeed: 358/358 constraints, PredecessorRefiner: 560/584 constraints, Known Traps: 3/3 constraints]
After SMT, in 61485ms problems are : Problem set: 36 solved, 548 unsolved
Search for dead transitions found 36 dead transitions in 61490ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 249/422 places, 549/2118 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 217 transition count 537
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 213 transition count 533
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 213 transition count 533
Applied a total of 52 rules in 4 ms. Remains 213 /249 variables (removed 36) and now considering 533/549 (removed 16) transitions.
// Phase 1: matrix 533 rows 213 cols
[2024-05-27 08:43:44] [INFO ] Computed 1 invariants in 4 ms
[2024-05-27 08:43:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-27 08:43:44] [INFO ] Invariant cache hit.
[2024-05-27 08:43:44] [INFO ] State equation strengthened by 350 read => feed constraints.
[2024-05-27 08:43:45] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 213/422 places, 533/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63570 ms. Remains : 213/422 places, 533/2118 transitions.
[2024-05-27 08:43:45] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:43:45] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:43:45] [INFO ] Input system was already deterministic with 533 transitions.
[2024-05-27 08:43:45] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:43:45] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:43:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1547037047337914195.gal : 2 ms
[2024-05-27 08:43:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3220872869298583821.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/CTLFireability1547037047337914195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3220872869298583821.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-27 08:44:15] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:44:15] [INFO ] Applying decomposition
[2024-05-27 08:44:15] [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/graph12318908049394150140.txt' '-o' '/tmp/graph12318908049394150140.bin' '-w' '/tmp/graph12318908049394150140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12318908049394150140.bin' '-l' '-1' '-v' '-w' '/tmp/graph12318908049394150140.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:44:15] [INFO ] Decomposing Gal with order
[2024-05-27 08:44:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:44:15] [INFO ] Removed a total of 365 redundant transitions.
[2024-05-27 08:44:15] [INFO ] Flatten gal took : 21 ms
[2024-05-27 08:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 4 ms.
[2024-05-27 08:44:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9084840366993316605.gal : 3 ms
[2024-05-27 08:44:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9278181532825133550.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/CTLFireability9084840366993316605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9278181532825133550.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 : 422/422 places, 2118/2118 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 372 transition count 613
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 372 transition count 613
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 372 transition count 604
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 181 place count 300 transition count 532
Iterating global reduction 1 with 72 rules applied. Total rules applied 253 place count 300 transition count 532
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 295 place count 300 transition count 490
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 415 place count 180 transition count 370
Iterating global reduction 2 with 120 rules applied. Total rules applied 535 place count 180 transition count 370
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 631 place count 180 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 634 place count 177 transition count 235
Iterating global reduction 3 with 3 rules applied. Total rules applied 637 place count 177 transition count 235
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 639 place count 175 transition count 233
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 175 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 642 place count 175 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 646 place count 171 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 650 place count 171 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 654 place count 171 transition count 224
Applied a total of 654 rules in 36 ms. Remains 171 /422 variables (removed 251) and now considering 224/2118 (removed 1894) transitions.
// Phase 1: matrix 224 rows 171 cols
[2024-05-27 08:44:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 08:44:45] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 08:44:45] [INFO ] Invariant cache hit.
[2024-05-27 08:44:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-27 08:44:46] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 08:44:46] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-27 08:44:46] [INFO ] Invariant cache hit.
[2024-05-27 08:44:46] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 4 (OVERLAPS) 224/395 variables, 171/174 constraints. Problems are: Problem set: 24 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 61/235 constraints. Problems are: Problem set: 24 solved, 199 unsolved
[2024-05-27 08:44:49] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-27 08:44:49] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-27 08:44:49] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 3/238 constraints. Problems are: Problem set: 44 solved, 179 unsolved
[2024-05-27 08:44:52] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/239 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/239 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/239 constraints. Problems are: Problem set: 44 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 239 constraints, problems are : Problem set: 44 solved, 179 unsolved in 11196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 44 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 25/155 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/3 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 16/171 variables, 1/4 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/7 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 224/395 variables, 171/178 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 61/239 constraints. Problems are: Problem set: 44 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 179/418 constraints. Problems are: Problem set: 44 solved, 179 unsolved
[2024-05-27 08:45:02] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:45:03] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
[2024-05-27 08:45:04] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 3/421 constraints. Problems are: Problem set: 46 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/421 constraints. Problems are: Problem set: 46 solved, 177 unsolved
[2024-05-27 08:45:13] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:45:13] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:45:14] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:45:14] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:45:14] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/395 variables, 5/426 constraints. Problems are: Problem set: 46 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/426 constraints. Problems are: Problem set: 46 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/426 constraints. Problems are: Problem set: 46 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 426 constraints, problems are : Problem set: 46 solved, 177 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 179/223 constraints, Known Traps: 12/12 constraints]
After SMT, in 41515ms problems are : Problem set: 46 solved, 177 unsolved
Search for dead transitions found 46 dead transitions in 41518ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 171/422 places, 178/2118 transitions.
Graph (complete) has 483 edges and 171 vertex of which 129 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 129 transition count 160
Applied a total of 19 rules in 4 ms. Remains 129 /171 variables (removed 42) and now considering 160/178 (removed 18) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 08:45:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:45:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 08:45:27] [INFO ] Invariant cache hit.
[2024-05-27 08:45:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 08:45:27] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 129/422 places, 160/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42334 ms. Remains : 129/422 places, 160/2118 transitions.
[2024-05-27 08:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-27 08:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-27 08:45:27] [INFO ] Input system was already deterministic with 160 transitions.
RANDOM walk for 5454 steps (1162 resets) in 32 ms. (165 steps per ms) remains 0/1 properties
FORMULA RingSingleMessageInMbox-PT-d1m080-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 08:45:27] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:45:27] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12508857653062752528.gal : 1 ms
[2024-05-27 08:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13144371293221053832.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12508857653062752528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13144371293221053832.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 2118/2118 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 383 transition count 1062
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 383 transition count 1062
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 113 place count 383 transition count 1027
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 175 place count 321 transition count 965
Iterating global reduction 1 with 62 rules applied. Total rules applied 237 place count 321 transition count 965
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 360 place count 321 transition count 842
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 444 place count 237 transition count 758
Iterating global reduction 2 with 84 rules applied. Total rules applied 528 place count 237 transition count 758
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 2 with 208 rules applied. Total rules applied 736 place count 237 transition count 550
Applied a total of 736 rules in 26 ms. Remains 237 /422 variables (removed 185) and now considering 550/2118 (removed 1568) transitions.
// Phase 1: matrix 550 rows 237 cols
[2024-05-27 08:45:27] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 08:45:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-27 08:45:28] [INFO ] Invariant cache hit.
[2024-05-27 08:45:28] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-27 08:45:29] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2024-05-27 08:45:29] [INFO ] Invariant cache hit.
[2024-05-27 08:45:29] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
At refinement iteration 4 (OVERLAPS) 550/787 variables, 237/240 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/787 variables, 333/573 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 0/573 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 7 (OVERLAPS) 0/787 variables, 0/573 constraints. Problems are: Problem set: 24 solved, 525 unsolved
No progress, stopping.
After SMT solving in domain Real declared 787/787 variables, and 573 constraints, problems are : Problem set: 24 solved, 525 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 17/229 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 3 (OVERLAPS) 8/237 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 5 (OVERLAPS) 550/787 variables, 237/240 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 333/573 constraints. Problems are: Problem set: 24 solved, 525 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 525/1098 constraints. Problems are: Problem set: 24 solved, 525 unsolved
[2024-05-27 08:46:25] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-27 08:46:26] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 787/787 variables, and 1100 constraints, problems are : Problem set: 36 solved, 513 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 525/549 constraints, Known Traps: 2/2 constraints]
After SMT, in 61434ms problems are : Problem set: 36 solved, 513 unsolved
Search for dead transitions found 36 dead transitions in 61439ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/422 places, 514/2118 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 205 transition count 502
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 201 transition count 498
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 201 transition count 498
Applied a total of 52 rules in 5 ms. Remains 201 /237 variables (removed 36) and now considering 498/514 (removed 16) transitions.
// Phase 1: matrix 498 rows 201 cols
[2024-05-27 08:46:30] [INFO ] Computed 1 invariants in 4 ms
[2024-05-27 08:46:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 08:46:30] [INFO ] Invariant cache hit.
[2024-05-27 08:46:30] [INFO ] State equation strengthened by 325 read => feed constraints.
[2024-05-27 08:46:31] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 201/422 places, 498/2118 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63532 ms. Remains : 201/422 places, 498/2118 transitions.
[2024-05-27 08:46:31] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:46:31] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:46:31] [INFO ] Input system was already deterministic with 498 transitions.
[2024-05-27 08:46:31] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:46:31] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:46:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8344442329341324683.gal : 2 ms
[2024-05-27 08:46:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16938825536910869197.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/CTLFireability8344442329341324683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16938825536910869197.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-27 08:47:01] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:47:01] [INFO ] Applying decomposition
[2024-05-27 08:47:01] [INFO ] Flatten gal took : 11 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/graph2388283890910394288.txt' '-o' '/tmp/graph2388283890910394288.bin' '-w' '/tmp/graph2388283890910394288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2388283890910394288.bin' '-l' '-1' '-v' '-w' '/tmp/graph2388283890910394288.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:47:01] [INFO ] Decomposing Gal with order
[2024-05-27 08:47:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:47:01] [INFO ] Removed a total of 347 redundant transitions.
[2024-05-27 08:47:01] [INFO ] Flatten gal took : 20 ms
[2024-05-27 08:47:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 4 ms.
[2024-05-27 08:47:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7670062901351577043.gal : 3 ms
[2024-05-27 08:47:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6256342322983595579.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/CTLFireability7670062901351577043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6256342322983595579.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 : 422/422 places, 2118/2118 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 378 transition count 763
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 378 transition count 763
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 104 place count 378 transition count 747
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 172 place count 310 transition count 679
Iterating global reduction 1 with 68 rules applied. Total rules applied 240 place count 310 transition count 679
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 307 place count 310 transition count 612
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 415 place count 202 transition count 504
Iterating global reduction 2 with 108 rules applied. Total rules applied 523 place count 202 transition count 504
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 671 place count 202 transition count 356
Applied a total of 671 rules in 35 ms. Remains 202 /422 variables (removed 220) and now considering 356/2118 (removed 1762) transitions.
// Phase 1: matrix 356 rows 202 cols
[2024-05-27 08:47:31] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:47:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 08:47:31] [INFO ] Invariant cache hit.
[2024-05-27 08:47:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-27 08:47:32] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-27 08:47:32] [INFO ] Redundant transitions in 2 ms returned []
Running 355 sub problems to find dead transitions.
[2024-05-27 08:47:32] [INFO ] Invariant cache hit.
[2024-05-27 08:47:32] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 4 (OVERLAPS) 356/558 variables, 202/205 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 168/373 constraints. Problems are: Problem set: 24 solved, 331 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/373 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/373 constraints. Problems are: Problem set: 24 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 373 constraints, problems are : Problem set: 24 solved, 331 unsolved in 14003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 17/194 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 8/202 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 356/558 variables, 202/205 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 168/373 constraints. Problems are: Problem set: 24 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 331/704 constraints. Problems are: Problem set: 24 solved, 331 unsolved
[2024-05-27 08:47:56] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 2 ms to minimize.
[2024-05-27 08:47:57] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 08:47:58] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 08:47:58] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
[2024-05-27 08:48:03] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-05-27 08:48:03] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 6/710 constraints. Problems are: Problem set: 46 solved, 309 unsolved
[2024-05-27 08:48:09] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:48:14] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 2/712 constraints. Problems are: Problem set: 46 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 712 constraints, problems are : Problem set: 46 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 331/355 constraints, Known Traps: 8/8 constraints]
After SMT, in 44680ms problems are : Problem set: 46 solved, 309 unsolved
Search for dead transitions found 46 dead transitions in 44683ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 202/422 places, 310/2118 transitions.
Graph (complete) has 670 edges and 202 vertex of which 160 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 160 transition count 292
Applied a total of 19 rules in 8 ms. Remains 160 /202 variables (removed 42) and now considering 292/310 (removed 18) transitions.
// Phase 1: matrix 292 rows 160 cols
[2024-05-27 08:48:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:48:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:48:17] [INFO ] Invariant cache hit.
[2024-05-27 08:48:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 08:48:17] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 160/422 places, 292/2118 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45852 ms. Remains : 160/422 places, 292/2118 transitions.
[2024-05-27 08:48:17] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:48:17] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:48:17] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-27 08:48:17] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:48:17] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:48:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7604215816970607445.gal : 2 ms
[2024-05-27 08:48:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8012656648542840226.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/CTLFireability7604215816970607445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8012656648542840226.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-27 08:48:47] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:48:47] [INFO ] Applying decomposition
[2024-05-27 08:48:47] [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/graph8830405908898016431.txt' '-o' '/tmp/graph8830405908898016431.bin' '-w' '/tmp/graph8830405908898016431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8830405908898016431.bin' '-l' '-1' '-v' '-w' '/tmp/graph8830405908898016431.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:48:47] [INFO ] Decomposing Gal with order
[2024-05-27 08:48:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:48:47] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-27 08:48:47] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 2 ms.
[2024-05-27 08:48:47] [INFO ] Time to serialize gal into /tmp/CTLFireability495334565906262306.gal : 2 ms
[2024-05-27 08:48:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12286783666493499767.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/CTLFireability495334565906262306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12286783666493499767.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.
[2024-05-27 08:49:17] [INFO ] Flatten gal took : 43 ms
[2024-05-27 08:49:17] [INFO ] Flatten gal took : 45 ms
[2024-05-27 08:49:17] [INFO ] Applying decomposition
[2024-05-27 08:49:17] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph507449987647354656.txt' '-o' '/tmp/graph507449987647354656.bin' '-w' '/tmp/graph507449987647354656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph507449987647354656.bin' '-l' '-1' '-v' '-w' '/tmp/graph507449987647354656.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:49:18] [INFO ] Decomposing Gal with order
[2024-05-27 08:49:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:49:18] [INFO ] Removed a total of 1652 redundant transitions.
[2024-05-27 08:49:18] [INFO ] Flatten gal took : 341 ms
[2024-05-27 08:49:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1600 labels/synchronizations in 29 ms.
[2024-05-27 08:49:18] [INFO ] Time to serialize gal into /tmp/CTLFireability5462925288241208513.gal : 7 ms
[2024-05-27 08:49:18] [INFO ] Time to serialize properties into /tmp/CTLFireability18235861405320189763.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/CTLFireability5462925288241208513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18235861405320189763.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 15 CTL formulae.

BK_STOP 1716800062447

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="RingSingleMessageInMbox-PT-d1m080"
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 RingSingleMessageInMbox-PT-d1m080, 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 r334-tall-171679079600090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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