MCC'2024- Execution of r378-smll-171683810700066

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m18

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16203.995	3600000.00	3736836.00	11102.10	??F?????TF?T??T?	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683810700066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716897057187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 11:50:59] [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-28 11:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:51:00] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-05-28 11:51:00] [INFO ] Transformed 1295 places.
[2024-05-28 11:51:00] [INFO ] Transformed 749 transitions.
[2024-05-28 11:51:00] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 54 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 289 place count 210 transition count 465
Iterating global reduction 1 with 32 rules applied. Total rules applied 321 place count 210 transition count 465
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 330 place count 210 transition count 456
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 343 place count 197 transition count 443
Iterating global reduction 2 with 13 rules applied. Total rules applied 356 place count 197 transition count 443
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 367 place count 197 transition count 432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 372 place count 192 transition count 425
Iterating global reduction 3 with 5 rules applied. Total rules applied 377 place count 192 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 379 place count 192 transition count 423
Applied a total of 379 rules in 133 ms. Remains 192 /259 variables (removed 67) and now considering 423/749 (removed 326) transitions.
// Phase 1: matrix 423 rows 192 cols
[2024-05-28 11:51:00] [INFO ] Computed 5 invariants in 38 ms
[2024-05-28 11:51:01] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-28 11:51:01] [INFO ] Invariant cache hit.
[2024-05-28 11:51:01] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-05-28 11:51:02] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-28 11:51:02] [INFO ] Invariant cache hit.
[2024-05-28 11:51:02] [INFO ] State equation strengthened by 293 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 36 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-28 11:51:18] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-28 11:51:19] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 5 ms to minimize.
[2024-05-28 11:51:19] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 3 ms to minimize.
[2024-05-28 11:51:19] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-28 11:51:22] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-28 11:51:23] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (OVERLAPS) 423/615 variables, 192/205 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 293/498 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/615 variables, and 498 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 192/192 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 1/192 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (OVERLAPS) 423/615 variables, 192/205 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 293/498 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 422/920 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-28 11:52:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:52:01] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 11:52:04] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/615 variables, and 923 constraints, problems are : Problem set: 2 solved, 420 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 192/192 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 11/11 constraints]
After SMT, in 61718ms problems are : Problem set: 2 solved, 420 unsolved
Search for dead transitions found 2 dead transitions in 61752ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/259 places, 421/749 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 421
Applied a total of 1 rules in 21 ms. Remains 191 /192 variables (removed 1) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 191 cols
[2024-05-28 11:52:04] [INFO ] Computed 5 invariants in 12 ms
[2024-05-28 11:52:04] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-28 11:52:04] [INFO ] Invariant cache hit.
[2024-05-28 11:52:04] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-28 11:52:05] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 191/259 places, 421/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65506 ms. Remains : 191/259 places, 421/749 transitions.
Support contains 54 out of 191 places after structural reductions.
[2024-05-28 11:52:06] [INFO ] Flatten gal took : 123 ms
[2024-05-28 11:52:06] [INFO ] Flatten gal took : 70 ms
[2024-05-28 11:52:06] [INFO ] Input system was already deterministic with 421 transitions.
Support contains 53 out of 191 places (down from 54) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 63
RANDOM walk for 40000 steps (9038 resets) in 4067 ms. (9 steps per ms) remains 59/63 properties
BEST_FIRST walk for 4002 steps (430 resets) in 93 ms. (42 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (216 resets) in 54 ms. (72 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (183 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (174 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (178 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (201 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (202 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (184 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (178 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (174 resets) in 69 ms. (57 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (168 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (200 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (187 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (201 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (208 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (219 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (171 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (199 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (189 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (194 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (186 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (207 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (176 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (175 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (200 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (184 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (213 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (421 resets) in 43 ms. (90 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (192 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (186 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (204 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (184 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (208 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (190 resets) in 43 ms. (90 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (171 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (178 resets) in 44 ms. (88 steps per ms) remains 56/59 properties
BEST_FIRST walk for 4001 steps (189 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (177 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (424 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (209 resets) in 49 ms. (80 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (189 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (206 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (414 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (199 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (175 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (176 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (179 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (163 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (193 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (184 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (205 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (193 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (206 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (165 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (200 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (198 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (209 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (206 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
[2024-05-28 11:52:08] [INFO ] Invariant cache hit.
[2024-05-28 11:52:08] [INFO ] State equation strengthened by 292 read => feed constraints.
Problem AtomicPropp58 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 80/127 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 45/172 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 417/589 variables, 172/177 constraints. Problems are: Problem set: 1 solved, 55 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 288/465 constraints. Problems are: Problem set: 1 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 55 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 8 (OVERLAPS) 23/612 variables, 19/484 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 4/488 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/488 constraints. Problems are: Problem set: 10 solved, 46 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 (/ 43.0 4.0))
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 (/ 1.0 8.0))
(s70 0.0)
(s71 0.0)
(s72 (/ 7.0 8.0))
(s73 1.0)
(s74 (/ 1.0 4.0))
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 2.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/612 variables, and 488 constraints, problems are : Problem set: 10 solved, 46 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 83/126 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 45/171 variables, 3/5 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 416/587 variables, 171/176 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 287/463 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 2/465 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/465 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 25/612 variables, 20/485 constraints. Problems are: Problem set: 10 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 5/490 constraints. Problems are: Problem set: 10 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/612 variables, and 534 constraints, problems are : Problem set: 10 solved, 46 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 46/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 10448ms problems are : Problem set: 10 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 421/421 transitions.
Graph (complete) has 717 edges and 191 vertex of which 189 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 189 transition count 419
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 183 transition count 406
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 183 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 183 transition count 405
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 178 transition count 399
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 178 transition count 399
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 174 transition count 395
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 174 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 174 transition count 392
Applied a total of 37 rules in 134 ms. Remains 174 /191 variables (removed 17) and now considering 392/421 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 174/191 places, 392/421 transitions.
RANDOM walk for 40000 steps (8949 resets) in 1181 ms. (33 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (426 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (187 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (193 resets) in 80 ms. (49 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (194 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (194 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (183 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (205 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (205 resets) in 53 ms. (74 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (191 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (188 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (198 resets) in 44 ms. (88 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (201 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (204 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (200 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (202 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (202 resets) in 56 ms. (70 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (182 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (216 resets) in 45 ms. (87 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (203 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (173 resets) in 43 ms. (91 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (186 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (197 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (185 resets) in 52 ms. (75 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (413 resets) in 39 ms. (100 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (169 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (187 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (212 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (205 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (197 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (180 resets) in 50 ms. (78 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (181 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (199 resets) in 54 ms. (72 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (395 resets) in 44 ms. (88 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (195 resets) in 59 ms. (66 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (407 resets) in 51 ms. (76 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (176 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (194 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (194 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (181 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (189 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (187 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (182 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (197 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (175 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (193 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
Interrupted probabilistic random walk after 191392 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :29 out of 46
Probabilistic random walk after 191392 steps, saw 91648 distinct states, run finished after 3006 ms. (steps per millisecond=63 ) properties seen :29
// Phase 1: matrix 392 rows 174 cols
[2024-05-28 11:52:23] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 11:52:23] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 82/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3/106 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 295/401 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 175/284 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 165/566 variables, 68/352 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 97/449 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/566 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 449 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 82/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3/106 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 295/401 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 175/285 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 165/566 variables, 68/353 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 97/450 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 17/467 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 11:52:27] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 469 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7245 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
After SMT, in 9003ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 5178 ms.
Support contains 21 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 162 transition count 307
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 162 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 162 transition count 305
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 151 transition count 294
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 151 transition count 294
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 151 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 147 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 147 transition count 278
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 78 place count 147 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 146 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 146 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 145 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 145 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 144 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 144 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 143 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 143 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 142 transition count 262
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 142 transition count 262
Applied a total of 88 rules in 70 ms. Remains 142 /174 variables (removed 32) and now considering 262/392 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 142/174 places, 262/392 transitions.
RANDOM walk for 40000 steps (8972 resets) in 432 ms. (92 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (183 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (191 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (201 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (177 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (204 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (182 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (188 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (204 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (190 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (403 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (184 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (198 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (202 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (179 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (178 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (189 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (204 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 232483 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :1 out of 17
Probabilistic random walk after 232483 steps, saw 104331 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :1
// Phase 1: matrix 262 rows 142 cols
[2024-05-28 11:52:41] [INFO ] Computed 3 invariants in 7 ms
[2024-05-28 11:52:41] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 68/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 234/325 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 135/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 79/404 variables, 51/280 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 28/308 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/404 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 308 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 68/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 234/325 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 135/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 79/404 variables, 51/280 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 28/308 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-28 11:52:44] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 325 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4893 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 5993ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 4095 ms.
Support contains 20 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 262/262 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 140 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 139 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 139 transition count 248
Applied a total of 7 rules in 35 ms. Remains 139 /142 variables (removed 3) and now considering 248/262 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 139/142 places, 248/262 transitions.
RANDOM walk for 40000 steps (9019 resets) in 408 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (179 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (186 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (192 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (184 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (194 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (194 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (420 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (204 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (199 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (192 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (194 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (205 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (192 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 220772 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 16
Probabilistic random walk after 220772 steps, saw 99774 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 248 rows 139 cols
[2024-05-28 11:52:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 11:52:54] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 67/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 231/321 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 135/228 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 66/387 variables, 49/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 17/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 294 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 139/139 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 67/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-28 11:52:56] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 231/321 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 135/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 66/387 variables, 49/278 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 17/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 16/311 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-28 11:52:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
[2024-05-28 11:52:57] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 313 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 139/139 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints]
After SMT, in 5534ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 3607 ms.
Support contains 20 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 248/248 transitions.
Applied a total of 0 rules in 15 ms. Remains 139 /139 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 139/139 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 248/248 transitions.
Applied a total of 0 rules in 12 ms. Remains 139 /139 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-28 11:53:03] [INFO ] Invariant cache hit.
[2024-05-28 11:53:04] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 11:53:04] [INFO ] Invariant cache hit.
[2024-05-28 11:53:04] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-28 11:53:04] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-28 11:53:04] [INFO ] Redundant transitions in 12 ms returned []
Running 247 sub problems to find dead transitions.
[2024-05-28 11:53:04] [INFO ] Invariant cache hit.
[2024-05-28 11:53:04] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/387 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 152/294 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-28 11:53:11] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/295 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 295 constraints, problems are : Problem set: 1 solved, 246 unsolved in 18643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 139/139 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 248/386 variables, 138/142 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 152/294 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 20/314 constraints. Problems are: Problem set: 1 solved, 246 unsolved
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/387 variables, 1/316 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 226/542 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 542 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 139/139 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 2/2 constraints]
After SMT, in 49000ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 49004ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/139 places, 247/248 transitions.
Graph (complete) has 469 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 138 /139 variables (removed 1) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 138 cols
[2024-05-28 11:53:53] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 11:53:53] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 11:53:53] [INFO ] Invariant cache hit.
[2024-05-28 11:53:53] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-28 11:53:54] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/139 places, 247/248 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50406 ms. Remains : 138/139 places, 247/248 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-05-28 11:53:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 11:53:54] [INFO ] Flatten gal took : 50 ms
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:53:54] [INFO ] Flatten gal took : 51 ms
[2024-05-28 11:53:54] [INFO ] Input system was already deterministic with 421 transitions.
Support contains 43 out of 191 places (down from 47) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 52 stabilizing places and 89 stable transitions
Graph (complete) has 788 edges and 191 vertex of which 189 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 155 transition count 192
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 155 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 155 transition count 188
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 104 place count 126 transition count 158
Iterating global reduction 2 with 29 rules applied. Total rules applied 133 place count 126 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 126 transition count 149
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 162 place count 106 transition count 129
Iterating global reduction 3 with 20 rules applied. Total rules applied 182 place count 106 transition count 129
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 194 place count 106 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 199 place count 101 transition count 110
Iterating global reduction 4 with 5 rules applied. Total rules applied 204 place count 101 transition count 110
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 209 place count 96 transition count 105
Iterating global reduction 4 with 5 rules applied. Total rules applied 214 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 218 place count 92 transition count 101
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 92 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 224 place count 92 transition count 99
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 228 place count 88 transition count 95
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 234 place count 86 transition count 93
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 237 place count 85 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 84 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 83 transition count 89
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 83 transition count 89
Applied a total of 242 rules in 32 ms. Remains 83 /191 variables (removed 108) and now considering 89/421 (removed 332) transitions.
// Phase 1: matrix 89 rows 83 cols
[2024-05-28 11:53:54] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:53:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 11:53:54] [INFO ] Invariant cache hit.
[2024-05-28 11:53:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 11:53:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-28 11:53:54] [INFO ] Invariant cache hit.
[2024-05-28 11:53:54] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-28 11:53:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-28 11:53:56] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 89/172 variables, 83/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-28 11:53:58] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/172 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-28 11:53:58] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/172 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 126 constraints, problems are : Problem set: 1 solved, 87 unsolved in 4835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/83 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 89/172 variables, 83/91 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 35/126 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 87/213 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/172 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 213 constraints, problems are : Problem set: 1 solved, 87 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 4/4 constraints]
After SMT, in 9180ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 9182ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 83/191 places, 88/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 88
Applied a total of 1 rules in 1 ms. Remains 82 /83 variables (removed 1) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2024-05-28 11:54:04] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:54:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 11:54:04] [INFO ] Invariant cache hit.
[2024-05-28 11:54:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 11:54:04] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/191 places, 88/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9809 ms. Remains : 82/191 places, 88/421 transitions.
[2024-05-28 11:54:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:54:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:54:04] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-28 11:54:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:54:04] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:54:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8751038939088414949.gal : 4 ms
[2024-05-28 11:54:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9231143605484334575.ctl : 6 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/CTLFireability8751038939088414949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9231143605484334575.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.10527e+09,11.3666,185240,2,11612,5,695110,6,0,416,498771,0

Converting to forward existential form...Done !
original formula: AF(EX(((p51>=1)&&(l0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((p51>=1)&&(l0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t34, t36, t37, t58, t65, t66, t67, t68, t69, t70, t71, t72, t75, t76, t79, t80, t81, t83,...274
Detected timeout of ITS tools.
[2024-05-28 11:54:34] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:54:34] [INFO ] Applying decomposition
[2024-05-28 11:54:34] [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/graph16246152621398167774.txt' '-o' '/tmp/graph16246152621398167774.bin' '-w' '/tmp/graph16246152621398167774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16246152621398167774.bin' '-l' '-1' '-v' '-w' '/tmp/graph16246152621398167774.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:54:34] [INFO ] Decomposing Gal with order
[2024-05-28 11:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:54:34] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-28 11:54:34] [INFO ] Flatten gal took : 59 ms
[2024-05-28 11:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 12 ms.
[2024-05-28 11:54:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10921918179155584347.gal : 7 ms
[2024-05-28 11:54:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8282097732509114711.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/CTLFireability10921918179155584347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8282097732509114711.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 159 transition count 233
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 159 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 159 transition count 229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 93 place count 133 transition count 202
Iterating global reduction 2 with 26 rules applied. Total rules applied 119 place count 133 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 133 transition count 193
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 145 place count 116 transition count 176
Iterating global reduction 3 with 17 rules applied. Total rules applied 162 place count 116 transition count 176
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 180 place count 116 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 114 transition count 154
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 114 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 112 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 112 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 110 transition count 150
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 109 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 109 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 108 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 108 transition count 148
Applied a total of 196 rules in 22 ms. Remains 108 /191 variables (removed 83) and now considering 148/421 (removed 273) transitions.
// Phase 1: matrix 148 rows 108 cols
[2024-05-28 11:55:04] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:55:05] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 11:55:05] [INFO ] Invariant cache hit.
[2024-05-28 11:55:05] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-28 11:55:05] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-28 11:55:05] [INFO ] Invariant cache hit.
[2024-05-28 11:55:05] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-28 11:55:07] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-28 11:55:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:55:08] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 148/256 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 76/191 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-28 11:55:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/192 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 192 constraints, problems are : Problem set: 1 solved, 146 unsolved in 12748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 146 unsolved
[2024-05-28 11:55:20] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 148/256 variables, 108/117 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 76/193 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 146/339 constraints. Problems are: Problem set: 1 solved, 146 unsolved
[2024-05-28 11:55:24] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 16 (OVERLAPS) 0/256 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 340 constraints, problems are : Problem set: 1 solved, 146 unsolved in 21141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 146/147 constraints, Known Traps: 6/6 constraints]
After SMT, in 34022ms problems are : Problem set: 1 solved, 146 unsolved
Search for dead transitions found 1 dead transitions in 34023ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/191 places, 147/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 147
Applied a total of 1 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 107 cols
[2024-05-28 11:55:39] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 11:55:39] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 11:55:39] [INFO ] Invariant cache hit.
[2024-05-28 11:55:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-28 11:55:39] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/191 places, 147/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35010 ms. Remains : 107/191 places, 147/421 transitions.
[2024-05-28 11:55:39] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:55:39] [INFO ] Flatten gal took : 12 ms
[2024-05-28 11:55:39] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-28 11:55:39] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:55:39] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability239703918733104712.gal : 6 ms
[2024-05-28 11:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6129991815499451298.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/CTLFireability239703918733104712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6129991815499451298.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 11:56:10] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:56:10] [INFO ] Applying decomposition
[2024-05-28 11:56:10] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16930205118477015959.txt' '-o' '/tmp/graph16930205118477015959.bin' '-w' '/tmp/graph16930205118477015959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16930205118477015959.bin' '-l' '-1' '-v' '-w' '/tmp/graph16930205118477015959.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:56:10] [INFO ] Decomposing Gal with order
[2024-05-28 11:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:56:10] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-28 11:56:10] [INFO ] Flatten gal took : 23 ms
[2024-05-28 11:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2024-05-28 11:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3553457232787863704.gal : 5 ms
[2024-05-28 11:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5384545074045094042.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/CTLFireability3553457232787863704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5384545074045094042.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 160 transition count 246
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 160 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 160 transition count 242
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 90 place count 135 transition count 216
Iterating global reduction 2 with 25 rules applied. Total rules applied 115 place count 135 transition count 216
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 135 transition count 207
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 139 place count 120 transition count 192
Iterating global reduction 3 with 15 rules applied. Total rules applied 154 place count 120 transition count 192
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 175 place count 120 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 118 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 118 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 181 place count 116 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 116 transition count 165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 114 transition count 163
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 114 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 113 transition count 162
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 113 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 112 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 112 transition count 161
Applied a total of 191 rules in 20 ms. Remains 112 /191 variables (removed 79) and now considering 161/421 (removed 260) transitions.
// Phase 1: matrix 161 rows 112 cols
[2024-05-28 11:56:40] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:56:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 11:56:40] [INFO ] Invariant cache hit.
[2024-05-28 11:56:40] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-28 11:56:40] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-28 11:56:40] [INFO ] Invariant cache hit.
[2024-05-28 11:56:40] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-28 11:56:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:56:43] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:56:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:56:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-28 11:56:44] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-28 11:56:45] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 161/273 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 207 constraints, problems are : Problem set: 0 solved, 160 unsolved in 12859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 161/273 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 160/367 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-28 11:56:58] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:56:58] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/369 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/369 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/369 constraints. Problems are: Problem set: 1 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 369 constraints, problems are : Problem set: 1 solved, 159 unsolved in 19796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 8/8 constraints]
After SMT, in 32820ms problems are : Problem set: 1 solved, 159 unsolved
Search for dead transitions found 1 dead transitions in 32823ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/191 places, 160/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 160
Applied a total of 1 rules in 3 ms. Remains 111 /112 variables (removed 1) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 111 cols
[2024-05-28 11:57:13] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 11:57:13] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 11:57:13] [INFO ] Invariant cache hit.
[2024-05-28 11:57:13] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-28 11:57:13] [INFO ] Implicit Places using invariants and state equation in 350 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 : 111/191 places, 160/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33725 ms. Remains : 111/191 places, 160/421 transitions.
[2024-05-28 11:57:13] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:57:13] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:57:14] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-28 11:57:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:57:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17060260784624421847.gal : 2 ms
[2024-05-28 11:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability379543480588752983.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/CTLFireability17060260784624421847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability379543480588752983.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-28 11:57:44] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:57:44] [INFO ] Applying decomposition
[2024-05-28 11:57:44] [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/graph6046699562032064275.txt' '-o' '/tmp/graph6046699562032064275.bin' '-w' '/tmp/graph6046699562032064275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6046699562032064275.bin' '-l' '-1' '-v' '-w' '/tmp/graph6046699562032064275.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:57:44] [INFO ] Decomposing Gal with order
[2024-05-28 11:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:57:44] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-28 11:57:44] [INFO ] Flatten gal took : 34 ms
[2024-05-28 11:57:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 12 ms.
[2024-05-28 11:57:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5424969537358835687.gal : 4 ms
[2024-05-28 11:57:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4676363911436165786.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/CTLFireability5424969537358835687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4676363911436165786.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 : 191/191 places, 421/421 transitions.
Graph (complete) has 788 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 159 transition count 222
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 159 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 67 place count 159 transition count 218
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 93 place count 133 transition count 191
Iterating global reduction 1 with 26 rules applied. Total rules applied 119 place count 133 transition count 191
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 128 place count 133 transition count 182
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 145 place count 116 transition count 165
Iterating global reduction 2 with 17 rules applied. Total rules applied 162 place count 116 transition count 165
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 177 place count 116 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 113 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 113 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 110 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 110 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 108 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 108 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 107 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 107 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 106 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 106 transition count 138
Applied a total of 197 rules in 43 ms. Remains 106 /191 variables (removed 85) and now considering 138/421 (removed 283) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-05-28 11:58:14] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 11:58:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 11:58:14] [INFO ] Invariant cache hit.
[2024-05-28 11:58:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 11:58:14] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-28 11:58:14] [INFO ] Redundant transitions in 1 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 11:58:14] [INFO ] Invariant cache hit.
[2024-05-28 11:58:14] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 11:58:17] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
[2024-05-28 11:58:17] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:58:17] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:58:17] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 11:58:18] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 138/244 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 68/183 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 11:58:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 184 constraints, problems are : Problem set: 1 solved, 136 unsolved in 11249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 136 unsolved
[2024-05-28 11:58:27] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 136 unsolved
[2024-05-28 11:58:28] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 12 (OVERLAPS) 138/244 variables, 106/118 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 68/186 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 136/322 constraints. Problems are: Problem set: 1 solved, 136 unsolved
[2024-05-28 11:58:31] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 1/323 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/244 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 323 constraints, problems are : Problem set: 1 solved, 136 unsolved in 15124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 136/137 constraints, Known Traps: 9/9 constraints]
After SMT, in 26517ms problems are : Problem set: 1 solved, 136 unsolved
Search for dead transitions found 1 dead transitions in 26519ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 106/191 places, 137/421 transitions.
Graph (complete) has 348 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 105 cols
[2024-05-28 11:58:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:58:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 11:58:41] [INFO ] Invariant cache hit.
[2024-05-28 11:58:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 11:58:41] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 105/191 places, 137/421 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 27345 ms. Remains : 105/191 places, 137/421 transitions.
[2024-05-28 11:58:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:58:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:58:41] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-28 11:58:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:58:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:58:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3488958391701685451.gal : 2 ms
[2024-05-28 11:58:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15414320641887832479.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/CTLFireability3488958391701685451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15414320641887832479.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.73243e+10,26.0167,394920,2,16706,5,1.58252e+06,6,0,557,1.43463e+06,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-28 11:59:11] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:59:11] [INFO ] Applying decomposition
[2024-05-28 11:59:11] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14464362207538093827.txt' '-o' '/tmp/graph14464362207538093827.bin' '-w' '/tmp/graph14464362207538093827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14464362207538093827.bin' '-l' '-1' '-v' '-w' '/tmp/graph14464362207538093827.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:59:11] [INFO ] Decomposing Gal with order
[2024-05-28 11:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:59:11] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-28 11:59:11] [INFO ] Flatten gal took : 14 ms
[2024-05-28 11:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 10 ms.
[2024-05-28 11:59:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2231859112895448365.gal : 6 ms
[2024-05-28 11:59:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8221555890699420439.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/CTLFireability2231859112895448365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8221555890699420439.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 159 transition count 235
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 159 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 159 transition count 229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 95 place count 133 transition count 202
Iterating global reduction 2 with 26 rules applied. Total rules applied 121 place count 133 transition count 202
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 131 place count 133 transition count 192
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 148 place count 116 transition count 175
Iterating global reduction 3 with 17 rules applied. Total rules applied 165 place count 116 transition count 175
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 184 place count 116 transition count 156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 113 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 113 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 110 transition count 148
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 110 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 108 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 107 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 106 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 106 transition count 144
Applied a total of 204 rules in 16 ms. Remains 106 /191 variables (removed 85) and now considering 144/421 (removed 277) transitions.
// Phase 1: matrix 144 rows 106 cols
[2024-05-28 11:59:41] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:59:41] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 11:59:41] [INFO ] Invariant cache hit.
[2024-05-28 11:59:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 11:59:42] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-28 11:59:42] [INFO ] Invariant cache hit.
[2024-05-28 11:59:42] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:59:45] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:59:45] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 144/250 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 74/186 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 186 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:59:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 74/187 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 143/330 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:59:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-28 11:59:57] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 2/332 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 332 constraints, problems are : Problem set: 1 solved, 142 unsolved in 19415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 5/5 constraints]
After SMT, in 29258ms problems are : Problem set: 1 solved, 142 unsolved
Search for dead transitions found 1 dead transitions in 29261ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/191 places, 143/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 143
Applied a total of 1 rules in 2 ms. Remains 105 /106 variables (removed 1) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2024-05-28 12:00:11] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:00:11] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 12:00:11] [INFO ] Invariant cache hit.
[2024-05-28 12:00:11] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 12:00:12] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/191 places, 143/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30327 ms. Remains : 105/191 places, 143/421 transitions.
[2024-05-28 12:00:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:00:12] [INFO ] Flatten gal took : 6 ms
[2024-05-28 12:00:12] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-28 12:00:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:00:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:00:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13351407982361836361.gal : 2 ms
[2024-05-28 12:00:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14756333950857986210.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/CTLFireability13351407982361836361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14756333950857986210.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-28 12:00:42] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:00:42] [INFO ] Applying decomposition
[2024-05-28 12:00:42] [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/graph3086918969040433000.txt' '-o' '/tmp/graph3086918969040433000.bin' '-w' '/tmp/graph3086918969040433000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3086918969040433000.bin' '-l' '-1' '-v' '-w' '/tmp/graph3086918969040433000.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:00:42] [INFO ] Decomposing Gal with order
[2024-05-28 12:00:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:00:42] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-28 12:00:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 12:00:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 5 ms.
[2024-05-28 12:00:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9105391296968663524.gal : 3 ms
[2024-05-28 12:00:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8116905097413378554.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/CTLFireability9105391296968663524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8116905097413378554.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 159 transition count 220
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 159 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 159 transition count 218
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 131 transition count 189
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 131 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 130 place count 131 transition count 180
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 149 place count 112 transition count 161
Iterating global reduction 3 with 19 rules applied. Total rules applied 168 place count 112 transition count 161
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 185 place count 112 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 110 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 110 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 191 place count 108 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 108 transition count 139
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 195 place count 106 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 106 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 106 transition count 134
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 104 transition count 132
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 104 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 205 place count 103 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 103 transition count 131
Applied a total of 206 rules in 13 ms. Remains 103 /191 variables (removed 88) and now considering 131/421 (removed 290) transitions.
// Phase 1: matrix 131 rows 103 cols
[2024-05-28 12:01:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:01:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 12:01:12] [INFO ] Invariant cache hit.
[2024-05-28 12:01:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 12:01:12] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-28 12:01:12] [INFO ] Invariant cache hit.
[2024-05-28 12:01:12] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 12:01:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-28 12:01:14] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/234 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 63/172 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6085 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 12:01:20] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:01:20] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 131/234 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 130/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 12:01:22] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:01:22] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 2/306 constraints. Problems are: Problem set: 1 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 1 solved, 129 unsolved in 10941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints]
After SMT, in 17148ms problems are : Problem set: 1 solved, 129 unsolved
Search for dead transitions found 1 dead transitions in 17151ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/191 places, 130/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 130
Applied a total of 1 rules in 2 ms. Remains 102 /103 variables (removed 1) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 102 cols
[2024-05-28 12:01:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:01:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 12:01:30] [INFO ] Invariant cache hit.
[2024-05-28 12:01:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 12:01:30] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/191 places, 130/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18015 ms. Remains : 102/191 places, 130/421 transitions.
[2024-05-28 12:01:30] [INFO ] Flatten gal took : 11 ms
[2024-05-28 12:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:01:30] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-28 12:01:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:01:30] [INFO ] Flatten gal took : 10 ms
[2024-05-28 12:01:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2339168761552713899.gal : 1 ms
[2024-05-28 12:01:30] [INFO ] Time to serialize properties into /tmp/CTLFireability116777904666024815.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/CTLFireability2339168761552713899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability116777904666024815.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 12:02:00] [INFO ] Flatten gal took : 6 ms
[2024-05-28 12:02:00] [INFO ] Applying decomposition
[2024-05-28 12:02:00] [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/graph18211448246434190193.txt' '-o' '/tmp/graph18211448246434190193.bin' '-w' '/tmp/graph18211448246434190193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18211448246434190193.bin' '-l' '-1' '-v' '-w' '/tmp/graph18211448246434190193.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:02:00] [INFO ] Decomposing Gal with order
[2024-05-28 12:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:02:00] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-28 12:02:00] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 3 ms.
[2024-05-28 12:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13067662349077658466.gal : 2 ms
[2024-05-28 12:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6184106254991426008.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/CTLFireability13067662349077658466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6184106254991426008.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 : 191/191 places, 421/421 transitions.
Graph (complete) has 788 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 160 transition count 233
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 160 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 64 place count 160 transition count 230
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 91 place count 133 transition count 202
Iterating global reduction 1 with 27 rules applied. Total rules applied 118 place count 133 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 127 place count 133 transition count 193
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 144 place count 116 transition count 176
Iterating global reduction 2 with 17 rules applied. Total rules applied 161 place count 116 transition count 176
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 176 place count 116 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 115 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 115 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 114 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 114 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 113 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 113 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 112 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 112 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 111 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 111 transition count 155
Applied a total of 186 rules in 31 ms. Remains 111 /191 variables (removed 80) and now considering 155/421 (removed 266) transitions.
// Phase 1: matrix 155 rows 111 cols
[2024-05-28 12:02:30] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 12:02:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 12:02:30] [INFO ] Invariant cache hit.
[2024-05-28 12:02:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-28 12:02:31] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-28 12:02:31] [INFO ] Redundant transitions in 1 ms returned []
Running 154 sub problems to find dead transitions.
[2024-05-28 12:02:31] [INFO ] Invariant cache hit.
[2024-05-28 12:02:31] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-28 12:02:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:02:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:02:33] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:02:33] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-28 12:02:33] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 155/266 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 80/200 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-28 12:02:35] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 201 constraints, problems are : Problem set: 0 solved, 154 unsolved in 9439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-28 12:02:41] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/266 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 154/356 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-28 12:02:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/357 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 13 (OVERLAPS) 0/266 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 357 constraints, problems are : Problem set: 1 solved, 153 unsolved in 16549 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 8/8 constraints]
After SMT, in 26139ms problems are : Problem set: 1 solved, 153 unsolved
Search for dead transitions found 1 dead transitions in 26141ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 111/191 places, 154/421 transitions.
Graph (complete) has 374 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 110 /111 variables (removed 1) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2024-05-28 12:02:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:02:57] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 12:02:57] [INFO ] Invariant cache hit.
[2024-05-28 12:02:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-28 12:02:57] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 110/191 places, 154/421 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 27069 ms. Remains : 110/191 places, 154/421 transitions.
[2024-05-28 12:02:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:02:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:02:57] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-28 12:02:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:02:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:02:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10713372672683701817.gal : 2 ms
[2024-05-28 12:02:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3200985275776357439.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/CTLFireability10713372672683701817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3200985275776357439.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-28 12:03:27] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:03:27] [INFO ] Applying decomposition
[2024-05-28 12:03:27] [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/graph11608760923629021167.txt' '-o' '/tmp/graph11608760923629021167.bin' '-w' '/tmp/graph11608760923629021167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11608760923629021167.bin' '-l' '-1' '-v' '-w' '/tmp/graph11608760923629021167.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:03:27] [INFO ] Decomposing Gal with order
[2024-05-28 12:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:03:27] [INFO ] Removed a total of 127 redundant transitions.
[2024-05-28 12:03:27] [INFO ] Flatten gal took : 20 ms
[2024-05-28 12:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 19 ms.
[2024-05-28 12:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17675170456538026267.gal : 2 ms
[2024-05-28 12:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14747361112729834685.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/CTLFireability17675170456538026267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14747361112729834685.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 421/421 transitions.
Graph (complete) has 788 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 156 transition count 205
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 156 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 73 place count 156 transition count 201
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 102 place count 127 transition count 171
Iterating global reduction 1 with 29 rules applied. Total rules applied 131 place count 127 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 140 place count 127 transition count 162
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 160 place count 107 transition count 142
Iterating global reduction 2 with 20 rules applied. Total rules applied 180 place count 107 transition count 142
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 107 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 103 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 99 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 214 place count 96 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 217 place count 96 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 96 transition count 112
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 222 place count 93 transition count 109
Iterating global reduction 4 with 3 rules applied. Total rules applied 225 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 227 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 90 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 88 transition count 103
Applied a total of 235 rules in 33 ms. Remains 88 /191 variables (removed 103) and now considering 103/421 (removed 318) transitions.
// Phase 1: matrix 103 rows 88 cols
[2024-05-28 12:03:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:03:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 12:03:58] [INFO ] Invariant cache hit.
[2024-05-28 12:03:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 12:03:58] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-28 12:03:58] [INFO ] Redundant transitions in 0 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-28 12:03:58] [INFO ] Invariant cache hit.
[2024-05-28 12:03:58] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:03:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:03:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/191 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 140 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/191 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 102/242 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:04:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/243 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 243 constraints, problems are : Problem set: 1 solved, 101 unsolved in 7147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 11278ms problems are : Problem set: 1 solved, 101 unsolved
Search for dead transitions found 1 dead transitions in 11280ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 88/191 places, 102/421 transitions.
Graph (complete) has 279 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 12:04:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:04:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 12:04:09] [INFO ] Invariant cache hit.
[2024-05-28 12:04:09] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 12:04:09] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 87/191 places, 102/421 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12005 ms. Remains : 87/191 places, 102/421 transitions.
[2024-05-28 12:04:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:04:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:04:09] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-28 12:04:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17623629649538641943.gal : 1 ms
[2024-05-28 12:04:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17756631518261967530.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/CTLFireability17623629649538641943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17756631518261967530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69146e+10,19.5383,294724,2,13252,5,1.27036e+06,6,0,450,824287,0

Converting to forward existential form...Done !
original formula: AG(AF(((s1<1)||(l1195<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1<1)||(l1195<1))))] = FALSE
Hit Full ! (commute/partial/dont) 2/91/100
(forward)formula 0,1,23.1166,294724,1,0,52,1.27036e+06,20,2,2649,824287,52
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 156 transition count 205
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 156 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 156 transition count 201
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 102 place count 127 transition count 171
Iterating global reduction 2 with 29 rules applied. Total rules applied 131 place count 127 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 127 transition count 162
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 160 place count 107 transition count 142
Iterating global reduction 3 with 20 rules applied. Total rules applied 180 place count 107 transition count 142
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 195 place count 107 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 199 place count 103 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 207 place count 99 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 211 place count 99 transition count 117
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 96 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 96 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 96 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 222 place count 93 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 225 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 227 place count 91 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 90 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 232 place count 89 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 234 place count 88 transition count 103
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 88 transition count 103
Applied a total of 235 rules in 14 ms. Remains 88 /191 variables (removed 103) and now considering 103/421 (removed 318) transitions.
// Phase 1: matrix 103 rows 88 cols
[2024-05-28 12:04:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:04:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 12:04:33] [INFO ] Invariant cache hit.
[2024-05-28 12:04:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 12:04:33] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-28 12:04:33] [INFO ] Invariant cache hit.
[2024-05-28 12:04:33] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:04:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:04:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/191 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 12:04:36] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 141 constraints, problems are : Problem set: 1 solved, 101 unsolved in 4935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 103/191 variables, 88/95 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 46/141 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 101/242 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 242 constraints, problems are : Problem set: 1 solved, 101 unsolved in 6365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 11385ms problems are : Problem set: 1 solved, 101 unsolved
Search for dead transitions found 1 dead transitions in 11386ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 88/191 places, 102/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 102
Applied a total of 1 rules in 1 ms. Remains 87 /88 variables (removed 1) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 12:04:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:04:45] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 12:04:45] [INFO ] Invariant cache hit.
[2024-05-28 12:04:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 12:04:45] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/191 places, 102/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12042 ms. Remains : 87/191 places, 102/421 transitions.
[2024-05-28 12:04:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:45] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-28 12:04:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12927740196903730037.gal : 1 ms
[2024-05-28 12:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability532466861243654426.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/CTLFireability12927740196903730037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability532466861243654426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69029e+10,20.4344,327440,2,13754,5,1.35886e+06,6,0,450,803078,0

Converting to forward existential form...Done !
original formula: AG(AX(AX((((s1<1)||(l1197<1))||(l0<1)))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * !((((s1<1)||(l1197<1))||(l0<1))))] = FALSE
(forward)formula 0,0,20.9536,327440,1,0,10,1.35886e+06,9,2,964,803078,3
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 165 transition count 275
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 165 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 165 transition count 270
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 76 place count 145 transition count 249
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 145 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 145 transition count 247
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 109 place count 134 transition count 236
Iterating global reduction 3 with 11 rules applied. Total rules applied 120 place count 134 transition count 236
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 133 place count 134 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 133 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 133 transition count 221
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 132 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 132 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 131 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 131 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 130 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 130 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 129 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 129 transition count 217
Applied a total of 143 rules in 20 ms. Remains 129 /191 variables (removed 62) and now considering 217/421 (removed 204) transitions.
// Phase 1: matrix 217 rows 129 cols
[2024-05-28 12:05:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:05:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 12:05:06] [INFO ] Invariant cache hit.
[2024-05-28 12:05:06] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-28 12:05:06] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 12:05:06] [INFO ] Invariant cache hit.
[2024-05-28 12:05:06] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 12:05:10] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-28 12:05:10] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 12:05:11] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:05:11] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:05:11] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 217/346 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 265 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13619 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 217/346 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 216/481 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 12:05:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:05:27] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 2/483 constraints. Problems are: Problem set: 1 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 215 unsolved
At refinement iteration 12 (OVERLAPS) 0/346 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 483 constraints, problems are : Problem set: 1 solved, 215 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 7/7 constraints]
After SMT, in 43920ms problems are : Problem set: 1 solved, 215 unsolved
Search for dead transitions found 1 dead transitions in 43923ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/191 places, 216/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 216
Applied a total of 1 rules in 1 ms. Remains 128 /129 variables (removed 1) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 128 cols
[2024-05-28 12:05:50] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 12:05:50] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 12:05:50] [INFO ] Invariant cache hit.
[2024-05-28 12:05:51] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-28 12:05:51] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/191 places, 216/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45065 ms. Remains : 128/191 places, 216/421 transitions.
[2024-05-28 12:05:51] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:05:51] [INFO ] Flatten gal took : 6 ms
[2024-05-28 12:05:51] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-28 12:05:51] [INFO ] Flatten gal took : 7 ms
[2024-05-28 12:05:51] [INFO ] Flatten gal took : 9 ms
[2024-05-28 12:05:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15003759658347188326.gal : 1 ms
[2024-05-28 12:05:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13613191683538718315.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/CTLFireability15003759658347188326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13613191683538718315.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-28 12:06:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 12:06:21] [INFO ] Applying decomposition
[2024-05-28 12:06:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5304550410688003703.txt' '-o' '/tmp/graph5304550410688003703.bin' '-w' '/tmp/graph5304550410688003703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5304550410688003703.bin' '-l' '-1' '-v' '-w' '/tmp/graph5304550410688003703.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:06:21] [INFO ] Decomposing Gal with order
[2024-05-28 12:06:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:06:21] [INFO ] Removed a total of 152 redundant transitions.
[2024-05-28 12:06:21] [INFO ] Flatten gal took : 16 ms
[2024-05-28 12:06:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 5 ms.
[2024-05-28 12:06:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7199324943238031591.gal : 3 ms
[2024-05-28 12:06:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7627874091706065562.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/CTLFireability7199324943238031591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7627874091706065562.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 156 transition count 205
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 156 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 156 transition count 201
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 101 place count 128 transition count 172
Iterating global reduction 2 with 28 rules applied. Total rules applied 129 place count 128 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 137 place count 128 transition count 164
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 156 place count 109 transition count 145
Iterating global reduction 3 with 19 rules applied. Total rules applied 175 place count 109 transition count 145
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 189 place count 109 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 192 place count 106 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 195 place count 106 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 103 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 103 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 101 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 101 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 99 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 97 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 97 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 214 place count 96 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 96 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 95 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 94 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 94 transition count 113
Applied a total of 219 rules in 18 ms. Remains 94 /191 variables (removed 97) and now considering 113/421 (removed 308) transitions.
// Phase 1: matrix 113 rows 94 cols
[2024-05-28 12:06:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:06:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 12:06:51] [INFO ] Invariant cache hit.
[2024-05-28 12:06:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 12:06:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 12:06:52] [INFO ] Invariant cache hit.
[2024-05-28 12:06:52] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 12:06:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:06:53] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/207 variables, 94/100 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 12:06:54] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 152 constraints, problems are : Problem set: 1 solved, 111 unsolved in 5302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 111 unsolved
[2024-05-28 12:06:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 113/207 variables, 94/102 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 51/153 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 111/264 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 111 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 264 constraints, problems are : Problem set: 1 solved, 111 unsolved in 7178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 111/112 constraints, Known Traps: 4/4 constraints]
After SMT, in 12576ms problems are : Problem set: 1 solved, 111 unsolved
Search for dead transitions found 1 dead transitions in 12578ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 94/191 places, 112/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 112
Applied a total of 1 rules in 1 ms. Remains 93 /94 variables (removed 1) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 93 cols
[2024-05-28 12:07:04] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 12:07:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 12:07:04] [INFO ] Invariant cache hit.
[2024-05-28 12:07:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 12:07:04] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/191 places, 112/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13287 ms. Remains : 93/191 places, 112/421 transitions.
[2024-05-28 12:07:04] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:04] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:04] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-28 12:07:04] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:04] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12829015338865772825.gal : 1 ms
[2024-05-28 12:07:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12090516307364143528.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/CTLFireability12829015338865772825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12090516307364143528.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.66258e+10,23.5029,352460,2,13738,5,1.55211e+06,6,0,484,1.19029e+06,0

Converting to forward existential form...Done !
original formula: EF((EX(((p66<1)||(l317<1))) * EG(((s1<1)||(l1188<1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EX(((p66<1)||(l317<1)))),((s1<1)||(l1188<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t34, t36, t37, t40, t41, t42, t43, t52, t54, t57, t58, t70, t71, t72, t73, t74, t75, t76,...350
Hit Full ! (commute/partial/dont) 2/0/110
(forward)formula 0,1,28.7868,352460,1,0,257,1.55211e+06,250,101,3509,1.19029e+06,281
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 155 transition count 192
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 155 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 155 transition count 188
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 105 place count 125 transition count 157
Iterating global reduction 2 with 30 rules applied. Total rules applied 135 place count 125 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 125 transition count 148
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 164 place count 105 transition count 128
Iterating global reduction 3 with 20 rules applied. Total rules applied 184 place count 105 transition count 128
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 196 place count 105 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 101 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 101 transition count 110
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 208 place count 97 transition count 106
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 97 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 94 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 222 place count 91 transition count 99
Iterating global reduction 5 with 3 rules applied. Total rules applied 225 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 227 place count 89 transition count 97
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 88 transition count 95
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 232 place count 87 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 234 place count 86 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 86 transition count 93
Applied a total of 235 rules in 20 ms. Remains 86 /191 variables (removed 105) and now considering 93/421 (removed 328) transitions.
// Phase 1: matrix 93 rows 86 cols
[2024-05-28 12:07:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:07:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 12:07:33] [INFO ] Invariant cache hit.
[2024-05-28 12:07:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 12:07:34] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-28 12:07:34] [INFO ] Invariant cache hit.
[2024-05-28 12:07:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-28 12:07:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:07:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-28 12:07:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 93/179 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-28 12:07:37] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:07:37] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
At refinement iteration 10 (OVERLAPS) 0/179 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 133 constraints, problems are : Problem set: 1 solved, 91 unsolved in 5561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 93/179 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 38/133 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 91/224 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 91 unsolved
At refinement iteration 14 (OVERLAPS) 0/179 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 224 constraints, problems are : Problem set: 1 solved, 91 unsolved in 5726 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 91/92 constraints, Known Traps: 5/5 constraints]
After SMT, in 11355ms problems are : Problem set: 1 solved, 91 unsolved
Search for dead transitions found 1 dead transitions in 11356ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 86/191 places, 92/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 92
Applied a total of 1 rules in 1 ms. Remains 85 /86 variables (removed 1) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 85 cols
[2024-05-28 12:07:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:07:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 12:07:45] [INFO ] Invariant cache hit.
[2024-05-28 12:07:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 12:07:45] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 85/191 places, 92/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11965 ms. Remains : 85/191 places, 92/421 transitions.
[2024-05-28 12:07:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:45] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-28 12:07:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:07:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:07:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16044288149092120646.gal : 1 ms
[2024-05-28 12:07:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3604117743208791004.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/CTLFireability16044288149092120646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3604117743208791004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52649e+10,13.9939,210936,2,13331,5,921920,6,0,432,614291,0

Converting to forward existential form...Done !
original formula: EX(EG(((s1<1)||(l961<1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((s1<1)||(l961<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/90
Detected timeout of ITS tools.
[2024-05-28 12:08:15] [INFO ] Flatten gal took : 3 ms
[2024-05-28 12:08:15] [INFO ] Applying decomposition
[2024-05-28 12:08:15] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph386466257648166965.txt' '-o' '/tmp/graph386466257648166965.bin' '-w' '/tmp/graph386466257648166965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph386466257648166965.bin' '-l' '-1' '-v' '-w' '/tmp/graph386466257648166965.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:08:15] [INFO ] Decomposing Gal with order
[2024-05-28 12:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:08:15] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 12:08:15] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2024-05-28 12:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3909588801277538599.gal : 1 ms
[2024-05-28 12:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14662255804134750482.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/CTLFireability3909588801277538599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14662255804134750482.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 : 191/191 places, 421/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 190 transition count 421
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 159 transition count 232
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 159 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 159 transition count 229
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 93 place count 132 transition count 201
Iterating global reduction 2 with 27 rules applied. Total rules applied 120 place count 132 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 129 place count 132 transition count 192
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 147 place count 114 transition count 174
Iterating global reduction 3 with 18 rules applied. Total rules applied 165 place count 114 transition count 174
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 185 place count 114 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 112 transition count 151
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 112 transition count 151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 191 place count 110 transition count 149
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 109 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 109 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 108 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 108 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 107 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 107 transition count 146
Applied a total of 199 rules in 13 ms. Remains 107 /191 variables (removed 84) and now considering 146/421 (removed 275) transitions.
// Phase 1: matrix 146 rows 107 cols
[2024-05-28 12:08:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:08:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 12:08:46] [INFO ] Invariant cache hit.
[2024-05-28 12:08:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 12:08:46] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-28 12:08:46] [INFO ] Invariant cache hit.
[2024-05-28 12:08:46] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 12:08:48] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-28 12:08:48] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
[2024-05-28 12:08:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 12:08:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 146/253 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 74/189 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 12:08:50] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:08:50] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 2/191 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 191 constraints, problems are : Problem set: 1 solved, 144 unsolved in 8560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 144 unsolved
[2024-05-28 12:08:56] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 146/253 variables, 107/118 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 74/192 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 144/336 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 144 unsolved
At refinement iteration 15 (OVERLAPS) 0/253 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 336 constraints, problems are : Problem set: 1 solved, 144 unsolved in 14443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 144/145 constraints, Known Traps: 7/7 constraints]
After SMT, in 23147ms problems are : Problem set: 1 solved, 144 unsolved
Search for dead transitions found 1 dead transitions in 23150ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/191 places, 145/421 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 145
Applied a total of 1 rules in 1 ms. Remains 106 /107 variables (removed 1) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 106 cols
[2024-05-28 12:09:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:09:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 12:09:09] [INFO ] Invariant cache hit.
[2024-05-28 12:09:09] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 12:09:10] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/191 places, 145/421 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24053 ms. Remains : 106/191 places, 145/421 transitions.
[2024-05-28 12:09:10] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:09:10] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:09:10] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-28 12:09:10] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:09:10] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:09:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14129406659714273451.gal : 1 ms
[2024-05-28 12:09:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10445869293543985628.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/CTLFireability14129406659714273451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10445869293543985628.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-28 12:09:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:09:40] [INFO ] Applying decomposition
[2024-05-28 12:09:40] [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/graph11919445164311270369.txt' '-o' '/tmp/graph11919445164311270369.bin' '-w' '/tmp/graph11919445164311270369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11919445164311270369.bin' '-l' '-1' '-v' '-w' '/tmp/graph11919445164311270369.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:09:40] [INFO ] Decomposing Gal with order
[2024-05-28 12:09:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:09:40] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-28 12:09:40] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:09:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 4 ms.
[2024-05-28 12:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9460036753064799126.gal : 2 ms
[2024-05-28 12:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15047679348110197207.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/CTLFireability9460036753064799126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15047679348110197207.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 : 191/191 places, 421/421 transitions.
Graph (complete) has 788 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 160 transition count 236
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 160 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 66 place count 160 transition count 231
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 91 place count 135 transition count 206
Iterating global reduction 1 with 25 rules applied. Total rules applied 116 place count 135 transition count 206
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 125 place count 135 transition count 197
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 120 transition count 182
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 120 transition count 182
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 172 place count 120 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 118 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 118 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 116 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 115 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 115 transition count 158
Applied a total of 182 rules in 23 ms. Remains 115 /191 variables (removed 76) and now considering 158/421 (removed 263) transitions.
// Phase 1: matrix 158 rows 115 cols
[2024-05-28 12:10:10] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 12:10:10] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 12:10:10] [INFO ] Invariant cache hit.
[2024-05-28 12:10:10] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-28 12:10:10] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-28 12:10:10] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-28 12:10:10] [INFO ] Invariant cache hit.
[2024-05-28 12:10:10] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-28 12:10:12] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:10:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:10:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:10:13] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-28 12:10:13] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:10:13] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 158/273 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 81/206 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-28 12:10:18] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
At refinement iteration 10 (OVERLAPS) 0/273 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 207 constraints, problems are : Problem set: 1 solved, 156 unsolved in 14779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 156 unsolved
[2024-05-28 12:10:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 158/273 variables, 115/127 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 81/208 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 156/364 constraints. Problems are: Problem set: 1 solved, 156 unsolved
[2024-05-28 12:10:31] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 365 constraints, problems are : Problem set: 1 solved, 156 unsolved in 20781 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 156/157 constraints, Known Traps: 9/9 constraints]
After SMT, in 35729ms problems are : Problem set: 1 solved, 156 unsolved
Search for dead transitions found 1 dead transitions in 35731ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/191 places, 157/421 transitions.
Graph (complete) has 385 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 114 /115 variables (removed 1) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 114 cols
[2024-05-28 12:10:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:10:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 12:10:46] [INFO ] Invariant cache hit.
[2024-05-28 12:10:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-28 12:10:46] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 114/191 places, 157/421 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 36723 ms. Remains : 114/191 places, 157/421 transitions.
[2024-05-28 12:10:46] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:10:46] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:10:46] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-28 12:10:46] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:10:46] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:10:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8667008287934203111.gal : 1 ms
[2024-05-28 12:10:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8459007699166541172.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/CTLFireability8667008287934203111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8459007699166541172.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-28 12:11:17] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:11:17] [INFO ] Applying decomposition
[2024-05-28 12:11:17] [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/graph8295911210725037353.txt' '-o' '/tmp/graph8295911210725037353.bin' '-w' '/tmp/graph8295911210725037353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8295911210725037353.bin' '-l' '-1' '-v' '-w' '/tmp/graph8295911210725037353.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:11:17] [INFO ] Decomposing Gal with order
[2024-05-28 12:11:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:11:17] [INFO ] Removed a total of 142 redundant transitions.
[2024-05-28 12:11:17] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:11:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 2 ms.
[2024-05-28 12:11:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16681048658194051089.gal : 3 ms
[2024-05-28 12:11:17] [INFO ] Time to serialize properties into /tmp/CTLFireability372808407208544075.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/CTLFireability16681048658194051089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability372808407208544075.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-28 12:11:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 12:11:47] [INFO ] Flatten gal took : 11 ms
[2024-05-28 12:11:47] [INFO ] Applying decomposition
[2024-05-28 12:11:47] [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/graph1054510783807507316.txt' '-o' '/tmp/graph1054510783807507316.bin' '-w' '/tmp/graph1054510783807507316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1054510783807507316.bin' '-l' '-1' '-v' '-w' '/tmp/graph1054510783807507316.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:11:47] [INFO ] Decomposing Gal with order
[2024-05-28 12:11:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:11:47] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-28 12:11:47] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:11:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 6 ms.
[2024-05-28 12:11:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3162297663667560830.gal : 4 ms
[2024-05-28 12:11:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4909521098467503304.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/CTLFireability3162297663667560830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4909521098467503304.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 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 12:38:21] [INFO ] Flatten gal took : 16 ms
[2024-05-28 12:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10524086231020074323.gal : 2 ms
[2024-05-28 12:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14787543745252179672.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/CTLFireability10524086231020074323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14787543745252179672.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 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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