Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300410.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994300410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749156838942

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 20:54:00] [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]
[2025-06-05 20:54:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:54:00] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-05 20:54:00] [INFO ] Transformed 1295 places.
[2025-06-05 20:54:00] [INFO ] Transformed 749 transitions.
[2025-06-05 20:54:00] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 50 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 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 294 place count 205 transition count 449
Iterating global reduction 1 with 37 rules applied. Total rules applied 331 place count 205 transition count 449
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 336 place count 205 transition count 444
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 353 place count 188 transition count 427
Iterating global reduction 2 with 17 rules applied. Total rules applied 370 place count 188 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 378 place count 188 transition count 419
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 387 place count 179 transition count 409
Iterating global reduction 3 with 9 rules applied. Total rules applied 396 place count 179 transition count 409
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 415 place count 179 transition count 390
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 416 place count 178 transition count 389
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 178 transition count 389
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 418 place count 177 transition count 388
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 177 transition count 388
Applied a total of 419 rules in 79 ms. Remains 177 /259 variables (removed 82) and now considering 388/749 (removed 361) transitions.
// Phase 1: matrix 388 rows 177 cols
[2025-06-05 20:54:00] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:00] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-06-05 20:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-05 20:54:03] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2025-06-05 20:54:03] [INFO ] Invariant cache hit.
[2025-06-05 20:54:03] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:07] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 1/177 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:12] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:12] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:12] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:12] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:12] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:14] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:14] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:14] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:14] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:54:14] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 8 (OVERLAPS) 388/565 variables, 177/193 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 265/458 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 458 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 177/177 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 1/177 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (OVERLAPS) 388/565 variables, 177/193 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 265/458 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 387/845 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 845 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 177/177 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 177/259 places, 388/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63526 ms. Remains : 177/259 places, 388/749 transitions.
Support contains 50 out of 177 places after structural reductions.
[2025-06-05 20:55:04] [INFO ] Flatten gal took : 48 ms
[2025-06-05 20:55:04] [INFO ] Flatten gal took : 27 ms
[2025-06-05 20:55:04] [INFO ] Input system was already deterministic with 388 transitions.
Reduction of identical properties reduced properties to check from 50 to 47
RANDOM walk for 40000 steps (9023 resets) in 3036 ms. (13 steps per ms) remains 43/47 properties
BEST_FIRST walk for 4003 steps (191 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (179 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (175 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (187 resets) in 22 ms. (173 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (198 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (201 resets) in 25 ms. (154 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (188 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (177 resets) in 47 ms. (83 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (194 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (181 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (202 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (188 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (164 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (412 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (195 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (198 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (188 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (190 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (399 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (439 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (411 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (182 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (194 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (203 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (421 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (190 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (183 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (198 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (210 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (172 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (187 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (172 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (207 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (206 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (200 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (184 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (182 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (195 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (213 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (185 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
[2025-06-05 20:55:05] [INFO ] Invariant cache hit.
[2025-06-05 20:55:05] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 72/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/158 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:06] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:06] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:06] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 373/531 variables, 158/166 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 250/416 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 9 (OVERLAPS) 34/565 variables, 19/435 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 15/450 constraints. Problems are: Problem set: 4 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 450 constraints, problems are : Problem set: 4 solved, 38 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 177/177 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 38 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 74/118 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 40/158 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:10] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:11] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:11] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:11] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 373/531 variables, 158/170 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 250/420 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/422 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/422 constraints. Problems are: Problem set: 4 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 34/565 variables, 19/441 constraints. Problems are: Problem set: 4 solved, 38 unsolved
SMT process timed out in 10103ms, After SMT, problems are : Problem set: 4 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 388/388 transitions.
Graph (complete) has 664 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 176 transition count 386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 175 transition count 384
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 175 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 174 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 174 transition count 383
Applied a total of 7 rules in 53 ms. Remains 174 /177 variables (removed 3) and now considering 383/388 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 174/177 places, 383/388 transitions.
RANDOM walk for 40000 steps (9014 resets) in 613 ms. (65 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (198 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (186 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (185 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (184 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (204 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (205 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (188 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (190 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (204 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (173 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (192 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (409 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (203 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (194 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (186 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (196 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (198 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (408 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (439 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (381 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (197 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (201 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (219 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (399 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (191 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (178 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (199 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (212 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (179 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (188 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (188 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (186 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (192 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
Interrupted probabilistic random walk after 529919 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :32 out of 38
Probabilistic random walk after 529919 steps, saw 196915 distinct states, run finished after 3008 ms. (steps per millisecond=176 ) properties seen :32
// Phase 1: matrix 383 rows 174 cols
[2025-06-05 20:55:19] [INFO ] Computed 4 invariants in 8 ms
[2025-06-05 20:55:19] [INFO ] State equation strengthened by 261 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 187/295 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 262/557 variables, 66/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 196/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/557 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 439 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:20] [INFO ] Deduced a trap composed of 27 places in 33 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, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 187/295 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 65/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 262/557 variables, 66/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 196/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 6/446 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/557 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 446 constraints, problems are : Problem set: 1 solved, 5 unsolved in 6089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7130ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 1108 ms.
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 383/383 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 147 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 147 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 147 transition count 182
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 125 transition count 159
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 125 transition count 159
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 125 transition count 147
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 125 place count 114 transition count 136
Iterating global reduction 2 with 11 rules applied. Total rules applied 136 place count 114 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 114 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 111 transition count 126
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 111 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 108 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 108 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 106 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 106 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 106 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 104 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 104 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 103 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 103 transition count 117
Applied a total of 165 rules in 28 ms. Remains 103 /174 variables (removed 71) and now considering 117/383 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 103/174 places, 117/383 transitions.
RANDOM walk for 40000 steps (9033 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1921 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1974 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Probably explored full state space saw : 59317 states, properties seen :3
Probabilistic random walk after 148987 steps, saw 59317 distinct states, run finished after 439 ms. (steps per millisecond=339 ) properties seen :3
Explored full state space saw : 59317 states, properties seen :0
Exhaustive walk after 148987 steps, saw 59317 distinct states, run finished after 286 ms. (steps per millisecond=520 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2025-06-05 20:55:28] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:55:28] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:55:28] [INFO ] Input system was already deterministic with 388 transitions.
Computed a total of 44 stabilizing places and 76 stable transitions
Graph (complete) has 729 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 146 transition count 193
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 146 transition count 193
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 146 transition count 187
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 94 place count 120 transition count 159
Iterating global reduction 1 with 26 rules applied. Total rules applied 120 place count 120 transition count 159
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 132 place count 120 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 146 place count 106 transition count 133
Iterating global reduction 2 with 14 rules applied. Total rules applied 160 place count 106 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 168 place count 106 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 173 place count 101 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 178 place count 101 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 183 place count 96 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 188 place count 96 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 84 transition count 98
Applied a total of 214 rules in 30 ms. Remains 84 /177 variables (removed 93) and now considering 98/388 (removed 290) transitions.
// Phase 1: matrix 98 rows 84 cols
[2025-06-05 20:55:28] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:28] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-05 20:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 20:55:29] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-05 20:55:29] [INFO ] Invariant cache hit.
[2025-06-05 20:55:29] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/182 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 146 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 97/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 243 constraints, problems are : Problem set: 0 solved, 97 unsolved in 18447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27405ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 27405ms
Starting structural reductions in LTL mode, iteration 1 : 84/177 places, 98/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27810 ms. Remains : 84/177 places, 98/388 transitions.
[2025-06-05 20:55:56] [INFO ] Flatten gal took : 9 ms
[2025-06-05 20:55:56] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:55:56] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-05 20:55:56] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:55:56] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:55:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9360427694068739761.gal : 2 ms
[2025-06-05 20:55:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14835637539204256341.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9360427694068739761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14835637539204256341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,66549,0.307532,17876,2,2593,5,58340,6,0,434,27131,0


Converting to forward existential form...Done !
original formula: (EX(((s1<1)||(l1201<1))) * EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG((Init * EX(((s1<1)||(l1201<1)))),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t47, t49, t59, t60, t61, t62, t63, t64, t65, t66, t67, t74, t75, t76, t77, t78, t79...305
(forward)formula 0,0,0.758484,30184,1,0,223,111131,218,89,2906,69833,253
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 149 transition count 208
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 149 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 149 transition count 203
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 86 place count 124 transition count 176
Iterating global reduction 1 with 25 rules applied. Total rules applied 111 place count 124 transition count 176
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 124 place count 124 transition count 163
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 137 place count 111 transition count 150
Iterating global reduction 2 with 13 rules applied. Total rules applied 150 place count 111 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 158 place count 111 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 108 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 108 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 105 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 105 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 103 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 102 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 101 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 101 transition count 131
Applied a total of 178 rules in 8 ms. Remains 101 /177 variables (removed 76) and now considering 131/388 (removed 257) transitions.
// Phase 1: matrix 131 rows 101 cols
[2025-06-05 20:55:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 20:55:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:57] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-05 20:55:57] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2025-06-05 20:55:57] [INFO ] Invariant cache hit.
[2025-06-05 20:55:57] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:59] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/232 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:01] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:02] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:02] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:03] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 183 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:10] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:10] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:10] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:10] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 131/232 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 65/187 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 130/317 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 317 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42250ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 42251ms
Starting structural reductions in LTL mode, iteration 1 : 101/177 places, 131/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42693 ms. Remains : 101/177 places, 131/388 transitions.
[2025-06-05 20:56:40] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:56:40] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:56:40] [INFO ] Input system was already deterministic with 131 transitions.
[2025-06-05 20:56:40] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:56:40] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:56:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14560945015860339120.gal : 2 ms
[2025-06-05 20:56:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10259966184356271048.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14560945015860339120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10259966184356271048.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,106259,0.489542,24140,2,3779,5,78468,6,0,535,36457,0


Converting to forward existential form...Done !
original formula: EF(!(E((!((A(((s1>=1)&&(l961>=1)) U ((s1>=1)&&(l1187>=1))) + EG(((s1>=1)&&(l1197>=1))))) + !((EF(((s1>=1)&&(l129>=1))) + AG(((s1>=1)&&(l1...197
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((!((E(!(((s1>=1)&&(l1187>=1))) U (!(((s1>=1)&&(l961>=1))) * !(((s1>=1)&&(l1187>=1))))...338
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t16, t18, t22, t25, t26, t28, t29, t46, t47, t48, t49, t54, t58, t60, t62, t76, t85,...402
(forward)formula 0,1,3.96321,138032,1,0,746,720673,306,373,3686,506242,851
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-01 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 : 177/177 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 153 transition count 248
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 153 transition count 248
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 60 place count 153 transition count 236
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 80 place count 133 transition count 214
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 133 transition count 214
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 133 transition count 202
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 119 place count 126 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 126 place count 126 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 126 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 123 transition count 189
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 123 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 121 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 121 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 119 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 119 transition count 184
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 117 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 117 transition count 182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 115 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 115 transition count 180
Applied a total of 150 rules in 14 ms. Remains 115 /177 variables (removed 62) and now considering 180/388 (removed 208) transitions.
// Phase 1: matrix 180 rows 115 cols
[2025-06-05 20:56:44] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 20:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:44] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-05 20:56:44] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-06-05 20:56:44] [INFO ] Invariant cache hit.
[2025-06-05 20:56:44] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:46] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:46] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:46] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:47] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:47] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:47] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:47] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 180/295 variables, 115/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 101/230 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:53] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:54] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:54] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:54] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:55] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:55] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/295 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 13 (OVERLAPS) 0/295 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 236 constraints, problems are : Problem set: 0 solved, 179 unsolved in 17597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 1/115 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 180/295 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 101/236 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 179/415 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 415 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47681ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 47682ms
Starting structural reductions in LTL mode, iteration 1 : 115/177 places, 180/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48091 ms. Remains : 115/177 places, 180/388 transitions.
[2025-06-05 20:57:32] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:57:32] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:57:32] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-05 20:57:32] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:57:32] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:57:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12882386603077378487.gal : 5 ms
[2025-06-05 20:57:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14003281269930693135.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12882386603077378487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14003281269930693135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,120481,1.26176,54340,2,3827,5,189332,6,0,640,59894,0


Converting to forward existential form...Done !
original formula: E((((EX(((((s1>=1)&&(l1200>=1))||((s1>=1)&&(l1191>=1)))&&(!((p50>=1)&&(l0>=1))))) + !(AG(((s1>=1)&&(l1191>=1))))) + (!((((s1>=1)&&(l1195>...305
=> equivalent forward existential formula: [(FwdU(Init,(((EX(((((s1>=1)&&(l1200>=1))||((s1>=1)&&(l1191>=1)))&&(!((p50>=1)&&(l0>=1))))) + !(!(E(TRUE U !(((s...375
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t23, t25, t26, t29, t30, t36, t37, t48, t49, t50, t51, t59, t61, t65, t70, t72, t76,...464
(forward)formula 0,1,3.10388,88536,1,0,275,321016,391,131,4477,135770,388
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 147 transition count 205
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 147 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 147 transition count 198
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 91 place count 123 transition count 172
Iterating global reduction 1 with 24 rules applied. Total rules applied 115 place count 123 transition count 172
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 127 place count 123 transition count 160
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 139 place count 111 transition count 148
Iterating global reduction 2 with 12 rules applied. Total rules applied 151 place count 111 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 111 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 107 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 107 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 168 place count 103 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 103 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 100 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 93 transition count 122
Applied a total of 192 rules in 14 ms. Remains 93 /177 variables (removed 84) and now considering 122/388 (removed 266) transitions.
// Phase 1: matrix 122 rows 93 cols
[2025-06-05 20:57:35] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:35] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 20:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:57:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 20:57:35] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-05 20:57:35] [INFO ] Invariant cache hit.
[2025-06-05 20:57:35] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:37] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:37] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/215 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 61/166 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:39] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:42] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 8 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/215 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/215 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 121/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 29499 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40425ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 40426ms
Starting structural reductions in LTL mode, iteration 1 : 93/177 places, 122/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40677 ms. Remains : 93/177 places, 122/388 transitions.
[2025-06-05 20:58:16] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:58:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:58:16] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-05 20:58:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:58:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:58:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7204675523211253827.gal : 1 ms
[2025-06-05 20:58:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7536395744988055066.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7204675523211253827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7536395744988055066.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,84883,0.606859,31092,2,2885,5,124466,6,0,494,43997,0


Converting to forward existential form...Done !
original formula: AG(AF((!(E(AF(((p54>=1)&&(l0>=1))) U EF(((s1>=1)&&(l1187>=1))))) * AX(((s1>=1)&&(l1189>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(E(!(EG(!(((p54>=1)&&(l0>=1))))) U E(TRUE U ((s1>=1)&&(l1187>=1))))) * !(EX(!(((s1>=1)...183
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t45, t49, t51, t54, t68, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87...352
(forward)formula 0,0,2.63702,90648,1,0,466,453607,282,208,3363,256853,590
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 146 transition count 193
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 146 transition count 193
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 146 transition count 187
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 94 place count 120 transition count 159
Iterating global reduction 1 with 26 rules applied. Total rules applied 120 place count 120 transition count 159
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 132 place count 120 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 146 place count 106 transition count 133
Iterating global reduction 2 with 14 rules applied. Total rules applied 160 place count 106 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 168 place count 106 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 173 place count 101 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 178 place count 101 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 183 place count 96 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 188 place count 96 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 84 transition count 98
Applied a total of 214 rules in 31 ms. Remains 84 /177 variables (removed 93) and now considering 98/388 (removed 290) transitions.
// Phase 1: matrix 98 rows 84 cols
[2025-06-05 20:58:18] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 20:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 20:58:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:58:19] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-05 20:58:19] [INFO ] Invariant cache hit.
[2025-06-05 20:58:19] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:21] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 145 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 97/242 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:34] [INFO ] Deduced a trap along path composed of 17 places in 32 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/182 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/182 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 243 constraints, problems are : Problem set: 0 solved, 97 unsolved in 22157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28249ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 28250ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/177 places, 98/388 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28552 ms. Remains : 84/177 places, 98/388 transitions.
[2025-06-05 20:58:47] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:58:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:58:47] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-05 20:58:47] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:58:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16022786468855919182.gal : 1 ms
[2025-06-05 20:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14560657039724138514.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16022786468855919182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14560657039724138514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,67981,0.267273,15620,2,2590,5,48052,6,0,434,25436,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l1190<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l1190<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/96
(forward)formula 0,1,1.48541,56384,1,0,56,229288,19,4,2278,153616,52
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 152 transition count 254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 152 transition count 254
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 61 place count 152 transition count 243
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 132 transition count 221
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 132 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 112 place count 132 transition count 210
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 123 transition count 201
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 123 transition count 201
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 123 transition count 191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 120 transition count 187
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 120 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 118 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 118 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 116 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 116 transition count 182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 114 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 114 transition count 180
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 160 place count 112 transition count 178
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 112 transition count 178
Applied a total of 162 rules in 16 ms. Remains 112 /177 variables (removed 65) and now considering 178/388 (removed 210) transitions.
// Phase 1: matrix 178 rows 112 cols
[2025-06-05 20:58:48] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:48] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 20:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:58:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-05 20:58:49] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-05 20:58:49] [INFO ] Invariant cache hit.
[2025-06-05 20:58:49] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:51] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/290 variables, 112/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 100/225 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:55] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:58:57] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 227 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 1/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/290 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 177/404 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 404 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49215ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 49217ms
Starting structural reductions in LTL mode, iteration 1 : 112/177 places, 178/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49692 ms. Remains : 112/177 places, 178/388 transitions.
[2025-06-05 20:59:38] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:59:38] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:59:38] [INFO ] Input system was already deterministic with 178 transitions.
[2025-06-05 20:59:38] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:59:38] [INFO ] Flatten gal took : 5 ms
[2025-06-05 20:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1963812073165097076.gal : 1 ms
[2025-06-05 20:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17811773872806719264.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1963812073165097076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17811773872806719264.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,132359,1.80364,70676,2,3929,5,262066,6,0,626,76881,0


Converting to forward existential form...Done !
original formula: AF((EX(!(A(!(((s1>=1)&&(l1197>=1))) U !(((s1>=1)&&(l966>=1)))))) + (((EF(((s1<1)||(l1201<1))) * AG(((s1>=1)&&(l1199>=1)))) * ((s1>=1)&&(l...317
=> equivalent forward existential formula: [FwdG(Init,!((EX(!(!((E(!(!(((s1>=1)&&(l966>=1)))) U (!(!(((s1>=1)&&(l1197>=1)))) * !(!(((s1>=1)&&(l966>=1))))))...473
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t29, t31, t42, t43, t44, t45, t50, t54, t59, t60, t65, t67, t70, t72, t83, t92,...531
(forward)formula 0,0,6.88469,186300,1,0,679,777081,402,427,4358,578038,772
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 146 transition count 182
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 146 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 146 transition count 177
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 93 place count 120 transition count 150
Iterating global reduction 1 with 26 rules applied. Total rules applied 119 place count 120 transition count 150
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 130 place count 120 transition count 139
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 145 place count 105 transition count 124
Iterating global reduction 2 with 15 rules applied. Total rules applied 160 place count 105 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 168 place count 105 transition count 116
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 99 transition count 109
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 99 transition count 109
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 93 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 93 transition count 103
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 197 place count 88 transition count 97
Iterating global reduction 3 with 5 rules applied. Total rules applied 202 place count 88 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 208 place count 84 transition count 91
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 84 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 214 place count 82 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 82 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 81 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 80 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 80 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 221 place count 79 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 79 transition count 85
Applied a total of 222 rules in 30 ms. Remains 79 /177 variables (removed 98) and now considering 85/388 (removed 303) transitions.
// Phase 1: matrix 85 rows 79 cols
[2025-06-05 20:59:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:59:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 20:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:59:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 20:59:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:59:45] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-05 20:59:45] [INFO ] Invariant cache hit.
[2025-06-05 20:59:45] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:46] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/164 variables, 79/89 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:48] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:59:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 125 constraints, problems are : Problem set: 0 solved, 84 unsolved in 7440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 85/164 variables, 79/92 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 33/125 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 84/209 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 209 constraints, problems are : Problem set: 0 solved, 84 unsolved in 10282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17742ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 17742ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/177 places, 85/388 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17982 ms. Remains : 79/177 places, 85/388 transitions.
[2025-06-05 21:00:03] [INFO ] Flatten gal took : 9 ms
[2025-06-05 21:00:03] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:00:03] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-05 21:00:03] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:00:03] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:00:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10824982306208553668.gal : 0 ms
[2025-06-05 21:00:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5413032632649232096.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10824982306208553668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5413032632649232096.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,65913,0.185043,12832,2,2272,5,33527,6,0,401,18880,0


Converting to forward existential form...Done !
original formula: EG(AF(((p80>=1)&&(l963>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p80>=1)&&(l963>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t62, t63, t64, t65, t66, t67, t68, t69, t72, t73, t76, t77, t79, t80, t81, t82, t83, t84...255
(forward)formula 0,0,1.32301,52368,1,0,346,268625,197,155,2680,150052,447
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-06 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 : 177/177 places, 388/388 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 150 transition count 219
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 150 transition count 219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 150 transition count 212
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 128 transition count 189
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 128 transition count 189
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 116 place count 128 transition count 178
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 127 place count 117 transition count 167
Iterating global reduction 2 with 11 rules applied. Total rules applied 138 place count 117 transition count 167
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 147 place count 117 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 115 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 115 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 113 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 113 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 111 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 111 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 163 place count 111 transition count 147
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 109 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 109 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 108 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 108 transition count 144
Applied a total of 169 rules in 11 ms. Remains 108 /177 variables (removed 69) and now considering 144/388 (removed 244) transitions.
// Phase 1: matrix 144 rows 108 cols
[2025-06-05 21:00:04] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:00:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 21:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:00:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 21:00:05] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-06-05 21:00:05] [INFO ] Invariant cache hit.
[2025-06-05 21:00:05] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:06] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:06] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:06] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:06] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:07] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 144/252 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 71/195 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:10] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:11] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:13] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:13] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:15] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:00:20] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 9 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/252 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 16 (OVERLAPS) 0/252 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 206 constraints, problems are : Problem set: 0 solved, 143 unsolved in 25962 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 144/252 variables, 108/135 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 143/349 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/252 variables, and 349 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56039ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 56040ms
Starting structural reductions in LTL mode, iteration 1 : 108/177 places, 144/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56383 ms. Remains : 108/177 places, 144/388 transitions.
[2025-06-05 21:01:01] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:01:01] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:01:01] [INFO ] Input system was already deterministic with 144 transitions.
[2025-06-05 21:01:01] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:01:01] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16249221173426877388.gal : 1 ms
[2025-06-05 21:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12894405455296216599.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16249221173426877388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12894405455296216599.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,95191,0.493797,26816,2,4143,5,79358,6,0,576,35436,0


Converting to forward existential form...Done !
original formula: EG((((s1<1)||(l1197<1)) * (((p30<1)||(l0<1)) + (AG(((s1<1)||(l1201<1))) * EX((EF(((s1>=1)&&(l1196>=1))) + AF(((s1>=1)&&(l114>=1)))))))))
=> equivalent forward existential formula: [FwdG(Init,(((s1<1)||(l1197<1)) * (((p30<1)||(l0<1)) + (!(E(TRUE U !(((s1<1)||(l1201<1))))) * EX((E(TRUE U ((s1>...221
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t15, t28, t29, t30, t31, t33, t34, t51, t52, t53, t58, t63, t65, t68, t70, t80, t81,...501
(forward)formula 0,1,5.86432,193568,1,0,1046,907309,325,583,3931,704208,1131
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 146 transition count 193
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 146 transition count 193
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 146 transition count 187
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 94 place count 120 transition count 159
Iterating global reduction 1 with 26 rules applied. Total rules applied 120 place count 120 transition count 159
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 132 place count 120 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 146 place count 106 transition count 133
Iterating global reduction 2 with 14 rules applied. Total rules applied 160 place count 106 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 168 place count 106 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 173 place count 101 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 178 place count 101 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 183 place count 96 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 188 place count 96 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 84 transition count 98
Applied a total of 214 rules in 27 ms. Remains 84 /177 variables (removed 93) and now considering 98/388 (removed 290) transitions.
// Phase 1: matrix 98 rows 84 cols
[2025-06-05 21:01:07] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:01:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 21:01:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:01:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 21:01:07] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:01:07] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-05 21:01:07] [INFO ] Invariant cache hit.
[2025-06-05 21:01:07] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:08] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:08] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:08] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:08] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 8 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:11] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/182 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 143 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7914 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/182 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 44/144 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 97/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 241 constraints, problems are : Problem set: 0 solved, 97 unsolved in 19796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27733ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 27734ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/177 places, 98/388 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27982 ms. Remains : 84/177 places, 98/388 transitions.
[2025-06-05 21:01:35] [INFO ] Flatten gal took : 9 ms
[2025-06-05 21:01:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:01:35] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-05 21:01:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:01:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:01:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9614205402291595943.gal : 5 ms
[2025-06-05 21:01:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15670873001189270546.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9614205402291595943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15670873001189270546.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8977 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15670873001189270546.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 40
Finished probabilistic random walk after 17346 steps, run visited all 1 properties in 43 ms. (steps per millisecond=403 )
Probabilistic random walk after 17346 steps, saw 7882 distinct states, run finished after 46 ms. (steps per millisecond=377 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 147 transition count 205
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 147 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 147 transition count 198
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 122 transition count 171
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 122 transition count 171
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 122 transition count 159
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 109 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 109 transition count 146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 164 place count 109 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 169 place count 104 transition count 131
Iterating global reduction 3 with 5 rules applied. Total rules applied 174 place count 104 transition count 131
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 99 transition count 126
Iterating global reduction 3 with 5 rules applied. Total rules applied 184 place count 99 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 95 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 95 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 195 place count 95 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 92 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 90 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 208 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 87 transition count 109
Applied a total of 211 rules in 15 ms. Remains 87 /177 variables (removed 90) and now considering 109/388 (removed 279) transitions.
// Phase 1: matrix 109 rows 87 cols
[2025-06-05 21:01:35] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:01:35] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 21:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:01:35] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 21:01:35] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-06-05 21:01:35] [INFO ] Invariant cache hit.
[2025-06-05 21:01:35] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:36] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:37] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:37] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:37] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 109/196 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 52/153 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:41] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:41] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 7 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/196 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:44] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:01:44] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/196 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 0/196 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 157 constraints, problems are : Problem set: 0 solved, 108 unsolved in 12968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 109/196 variables, 87/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 52/157 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 108/265 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 265 constraints, problems are : Problem set: 0 solved, 108 unsolved in 23134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36140ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 36140ms
Starting structural reductions in LTL mode, iteration 1 : 87/177 places, 109/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36408 ms. Remains : 87/177 places, 109/388 transitions.
[2025-06-05 21:02:11] [INFO ] Flatten gal took : 8 ms
[2025-06-05 21:02:11] [INFO ] Flatten gal took : 7 ms
[2025-06-05 21:02:11] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-05 21:02:11] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:02:11] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:02:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12135875227536626760.gal : 1 ms
[2025-06-05 21:02:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9814619385800815652.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12135875227536626760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9814619385800815652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,74363,0.369311,21800,2,2754,5,71914,6,0,457,31507,0


Converting to forward existential form...Done !
original formula: EX(EG(EF(((EX(((s1>=1)&&(l1192>=1))) * (s1>=1)) * (l1201>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U ((EX(((s1>=1)&&(l1192>=1))) * (s1>=1)) * (l1201>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t50, t51, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75...350
(forward)formula 0,0,0.863163,33064,1,0,227,122368,245,89,3087,71403,274
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-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 : 177/177 places, 388/388 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 149 transition count 210
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 149 transition count 210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 149 transition count 201
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 88 place count 126 transition count 176
Iterating global reduction 1 with 23 rules applied. Total rules applied 111 place count 126 transition count 176
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 123 place count 126 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 133 place count 116 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 143 place count 116 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 116 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 112 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 112 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 109 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 109 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 106 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 106 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 106 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 103 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 103 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 101 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 101 transition count 130
Applied a total of 180 rules in 10 ms. Remains 101 /177 variables (removed 76) and now considering 130/388 (removed 258) transitions.
// Phase 1: matrix 130 rows 101 cols
[2025-06-05 21:02:12] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 21:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-05 21:02:12] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-05 21:02:12] [INFO ] Invariant cache hit.
[2025-06-05 21:02:12] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:14] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:15] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:15] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:15] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 130/231 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 183 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 130/231 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 129/312 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:37] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/231 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 313 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39331ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39332ms
Starting structural reductions in LTL mode, iteration 1 : 101/177 places, 130/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39613 ms. Remains : 101/177 places, 130/388 transitions.
[2025-06-05 21:02:52] [INFO ] Flatten gal took : 8 ms
[2025-06-05 21:02:52] [INFO ] Flatten gal took : 7 ms
[2025-06-05 21:02:52] [INFO ] Input system was already deterministic with 130 transitions.
[2025-06-05 21:02:52] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:02:52] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:02:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17801136115434654531.gal : 1 ms
[2025-06-05 21:02:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7573517440422697680.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17801136115434654531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7573517440422697680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,97263,0.468095,24504,2,3352,5,76639,6,0,534,37459,0


Converting to forward existential form...Done !
original formula: (EX(EF(((s1>=1)&&(l165>=1)))) * AF(((((E(((s1>=1)&&(l965>=1)) U ((s1>=1)&&(l1199>=1))) + (s1<1)) + (l953<1)) * (s1>=1)) * (l1187>=1))))
=> equivalent forward existential formula: ([(Init * !(EX(E(TRUE U ((s1>=1)&&(l165>=1))))))] = FALSE * [FwdG(Init,!(((((E(((s1>=1)&&(l965>=1)) U ((s1>=1)&&...226
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t26, t27, t31, t33, t44, t45, t46, t51, t53, t57, t59, t63, t64, t75, t84, t93,...375
(forward)formula 0,0,2.82567,101800,1,0,630,404208,290,382,3592,403289,591
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 150 transition count 231
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 150 transition count 231
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 64 place count 150 transition count 221
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 85 place count 129 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 106 place count 129 transition count 199
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 118 place count 129 transition count 187
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 119 transition count 177
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 119 transition count 177
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 148 place count 119 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 116 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 116 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 113 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 113 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 111 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 111 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 110 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 110 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 109 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 109 transition count 156
Applied a total of 168 rules in 17 ms. Remains 109 /177 variables (removed 68) and now considering 156/388 (removed 232) transitions.
// Phase 1: matrix 156 rows 109 cols
[2025-06-05 21:02:55] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 21:02:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:02:55] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-05 21:02:55] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-05 21:02:55] [INFO ] Invariant cache hit.
[2025-06-05 21:02:55] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:57] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/265 variables, 109/122 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 82/204 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:02:59] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:08] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 8 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/265 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 213 constraints, problems are : Problem set: 0 solved, 155 unsolved in 21688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:18] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/265 variables, 109/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 82/216 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 155/371 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 371 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51756ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 51757ms
Starting structural reductions in LTL mode, iteration 1 : 109/177 places, 156/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52089 ms. Remains : 109/177 places, 156/388 transitions.
[2025-06-05 21:03:47] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:03:47] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:03:47] [INFO ] Input system was already deterministic with 156 transitions.
[2025-06-05 21:03:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:03:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9284562605328338721.gal : 1 ms
[2025-06-05 21:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2428856653692613378.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9284562605328338721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2428856653692613378.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,132271,0.992813,44668,2,3978,5,164979,6,0,592,55508,0


Converting to forward existential form...Done !
original formula: A(AF((E(((((s1>=1)&&(l1205>=1))&&((s1>=1)&&(l1191>=1))) + EG(((s1>=1)&&(l193>=1)))) U ((s1>=1)&&(l1198>=1))) + ((s1>=1)&&(l1200>=1)))) U ...266
=> equivalent forward existential formula: [((Init * !(EG(!((E(EX((((s1>=1)&&(l1199>=1))||((s1>=1)&&(l958>=1)))) U ((s1>=1)&&(l1191>=1))) + !(E(TRUE U !(E(...623
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t19, t23, t32, t46, t47, t48, t49, t60, t66, t67, t78, t87, t96, t105, t106, t107, t...404
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,4.34416,147440,1,0,754,753795,360,419,4173,418293,926
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2025-11 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 : 177/177 places, 388/388 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 148 transition count 206
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 148 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 148 transition count 199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 89 place count 124 transition count 173
Iterating global reduction 1 with 24 rules applied. Total rules applied 113 place count 124 transition count 173
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 124 place count 124 transition count 162
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 137 place count 111 transition count 149
Iterating global reduction 2 with 13 rules applied. Total rules applied 150 place count 111 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 158 place count 111 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 107 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 107 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 104 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 104 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 102 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 100 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 100 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 98 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 98 transition count 126
Applied a total of 184 rules in 11 ms. Remains 98 /177 variables (removed 79) and now considering 126/388 (removed 262) transitions.
// Phase 1: matrix 126 rows 98 cols
[2025-06-05 21:03:51] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:03:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 21:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:03:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 21:03:52] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-05 21:03:52] [INFO ] Invariant cache hit.
[2025-06-05 21:03:52] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:52] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:52] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:53] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:53] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:54] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 126/224 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:55] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:56] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:56] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:56] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:03:56] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:00] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/224 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/224 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 179 constraints, problems are : Problem set: 0 solved, 125 unsolved in 15082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 126/224 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 125/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:34] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:34] [INFO ] Deduced a trap along path composed of 5 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/224 variables, and 306 constraints, problems are : Problem set: 0 solved, 125 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45137ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 45137ms
Starting structural reductions in LTL mode, iteration 1 : 98/177 places, 126/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45641 ms. Remains : 98/177 places, 126/388 transitions.
[2025-06-05 21:04:37] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:04:37] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:04:37] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-05 21:04:37] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:04:37] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:04:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6542499545123204326.gal : 1 ms
[2025-06-05 21:04:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7270157044688421305.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6542499545123204326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7270157044688421305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,86359,0.446188,23060,2,3213,5,73235,6,0,518,32839,0


Converting to forward existential form...Done !
original formula: A(((!(EF(!(((p11>=1)&&(l0>=1))))) * EX(AG(((s1>=1)&&(l1193>=1))))) * ((s1>=1)&&(l1195>=1))) U !(EG(AF(((s1>=1)&&(l1193>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(!(((s1>=1)&&(l1193>=1))))))))))) * !(E(!(!(EG(!(EG(!(((s1>=1)&&(l1193>=1)))))))) U (!...322
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t29, t31, t42, t43, t44, t45, t50, t53, t59, t62, t72, t73, t74, t75, t76, t77,...379
Using saturation style SCC detection
(forward)formula 0,1,2.23829,84392,1,0,473,404268,286,204,3567,247293,575
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 146 transition count 182
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 146 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 146 transition count 178
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 93 place count 119 transition count 149
Iterating global reduction 1 with 27 rules applied. Total rules applied 120 place count 119 transition count 149
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 132 place count 119 transition count 137
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 147 place count 104 transition count 122
Iterating global reduction 2 with 15 rules applied. Total rules applied 162 place count 104 transition count 122
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 104 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 176 place count 98 transition count 107
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 98 transition count 107
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 188 place count 92 transition count 101
Iterating global reduction 3 with 6 rules applied. Total rules applied 194 place count 92 transition count 101
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 199 place count 87 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 204 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 87 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 83 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 83 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 81 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 221 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 78 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 78 transition count 83
Applied a total of 224 rules in 25 ms. Remains 78 /177 variables (removed 99) and now considering 83/388 (removed 305) transitions.
// Phase 1: matrix 83 rows 78 cols
[2025-06-05 21:04:39] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:04:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 21:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:04:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 21:04:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:04:39] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-05 21:04:39] [INFO ] Invariant cache hit.
[2025-06-05 21:04:39] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:42] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/161 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:04:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/161 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 127 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 33/127 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 82/209 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 209 constraints, problems are : Problem set: 0 solved, 82 unsolved in 15951 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23281ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 23283ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/177 places, 83/388 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23529 ms. Remains : 78/177 places, 83/388 transitions.
[2025-06-05 21:05:03] [INFO ] Flatten gal took : 7 ms
[2025-06-05 21:05:03] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:03] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-05 21:05:03] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:03] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4691243650364303462.gal : 0 ms
[2025-06-05 21:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9023728433795360775.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4691243650364303462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9023728433795360775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,52819,0.180596,13076,2,2110,5,36281,6,0,395,18694,0


Converting to forward existential form...Done !
original formula: AF(AG(((s1<1)||(l948<1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((s1<1)||(l948<1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t61, t62, t63, t64, t65, t66, t67, t68, t71, t72, t75, t76, t78, t79, t80, t81, t82, In...250
(forward)formula 0,0,1.2061,49044,1,0,528,220553,194,300,2642,171180,476
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 388/388 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 147 transition count 205
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 147 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 147 transition count 198
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 122 transition count 171
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 122 transition count 171
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 122 transition count 159
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 109 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 109 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 163 place count 109 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 105 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 101 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 188 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 94 transition count 121
Applied a total of 193 rules in 18 ms. Remains 94 /177 variables (removed 83) and now considering 121/388 (removed 267) transitions.
// Phase 1: matrix 121 rows 94 cols
[2025-06-05 21:05:04] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:05:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 21:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:05:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 21:05:04] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:05:04] [INFO ] Redundant transitions in 8 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-05 21:05:04] [INFO ] Invariant cache hit.
[2025-06-05 21:05:04] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:05] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:05] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:06] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:06] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/215 variables, 94/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:08] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:11] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/215 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 168 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/215 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 60/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 120/288 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:26] [INFO ] Deduced a trap along path composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 289 constraints, problems are : Problem set: 0 solved, 120 unsolved in 29987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40548ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 40548ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/177 places, 121/388 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40911 ms. Remains : 94/177 places, 121/388 transitions.
[2025-06-05 21:05:45] [INFO ] Flatten gal took : 9 ms
[2025-06-05 21:05:45] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:45] [INFO ] Input system was already deterministic with 121 transitions.
[2025-06-05 21:05:45] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:45] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:05:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5743950077202209590.gal : 1 ms
[2025-06-05 21:05:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6416379698888318222.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5743950077202209590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6416379698888318222.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,83791,0.476895,24008,2,2928,5,84121,6,0,497,36617,0


Converting to forward existential form...Done !
original formula: E(!((A(!(((s1<1)||(l1201<1))) U EG(((s1>=1)&&(l1194>=1)))) + !(AG(!(((s1>=1)&&(l33>=1))))))) U (AG(AF(EG(((s1>=1)&&(l970>=1))))) + ((s1>=...171
=> equivalent forward existential formula: ([(FwdU(Init,!((!((E(!(EG(((s1>=1)&&(l1194>=1)))) U (!(!(((s1<1)||(l1201<1)))) * !(EG(((s1>=1)&&(l1194>=1)))))) ...534
Reverse transition relation is NOT exact ! Due to transitions t1, t34, t35, t36, t37, t40, t41, t42, t43, t49, t50, t57, t59, t70, t79, t80, t81, t82, t83,...365
(forward)formula 0,0,2.32368,85504,1,0,479,415010,282,214,3399,252402,574
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-14 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 : 177/177 places, 388/388 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 147 transition count 205
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 147 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 147 transition count 198
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 122 transition count 171
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 122 transition count 171
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 122 transition count 159
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 109 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 109 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 163 place count 109 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 105 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 101 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 101 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 97 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 97 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 94 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 92 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 91 transition count 114
Applied a total of 202 rules in 13 ms. Remains 91 /177 variables (removed 86) and now considering 114/388 (removed 274) transitions.
// Phase 1: matrix 114 rows 91 cols
[2025-06-05 21:05:47] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:05:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 21:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:05:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 21:05:47] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-05 21:05:47] [INFO ] Invariant cache hit.
[2025-06-05 21:05:47] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:48] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:49] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:49] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:49] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 114/205 variables, 91/101 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 156 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 114/205 variables, 91/101 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 113/269 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:05:57] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 205/205 variables, and 270 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34883ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 34884ms
Starting structural reductions in LTL mode, iteration 1 : 91/177 places, 114/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35160 ms. Remains : 91/177 places, 114/388 transitions.
[2025-06-05 21:06:22] [INFO ] Flatten gal took : 4 ms
[2025-06-05 21:06:22] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:06:22] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-05 21:06:22] [INFO ] Flatten gal took : 2 ms
[2025-06-05 21:06:22] [INFO ] Flatten gal took : 3 ms
[2025-06-05 21:06:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7027141235810087553.gal : 0 ms
[2025-06-05 21:06:22] [INFO ] Time to serialize properties into /tmp/CTLFireability972715817302649195.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7027141235810087553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability972715817302649195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,82809,0.472279,23596,2,2981,5,80972,6,0,478,36443,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(((s1>=1)&&(l1194>=1)))) + (EF(((s1>=1)&&(l1198>=1))) * ((s1<1)||(l149<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(((s1>=1)&&(l1194>=1)))))) + (E(TRUE U ((s1>=1)&&(l1198>=1))) * ((s1<1)||(l149<1))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t37, t38, t39, t45, t46, t50, t53, t54, t64, t72, t80, t87, t88, t89, t90, t91,...327
(forward)formula 0,1,1.52949,52284,1,0,288,222864,257,129,3279,139710,357
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-05 21:06:24] [INFO ] Flatten gal took : 17 ms
[2025-06-05 21:06:24] [INFO ] Flatten gal took : 9 ms
Total runtime 744343 ms.

BK_STOP 1749157584453

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d1m06"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r212-tall-174901994300410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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